UVA_11518.cpp

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define PF push_front
#define P push
#define INC(i,a,b) for (ll i = a; i <= b; i++)
#define DEC(i,b,a) for (ll i = b; i >= a ; i--)
#define inf LLONG_MAX
#define neginf LLONG_MIN
#define mod  1000000007
#define eps 1e-9
typedef ostringstream OS ;
typedef stringstream SS ;
typedef long long ll ;
typedef unsigned long long ull;
typedef pair < ll , ll > PLL ;
typedef pair < char,ll > PCL ;
typedef deque < double > DD ;
typedef deque < PCL > DCL ;
typedef deque < ll > DL ;
typedef deque < PLL > DLL ;
typedef deque < char > DC ;
typedef deque < string > DS ;
typedef vector < double > VD;
typedef vector < PCL > VCL ;
typedef vector < ll > VL;
typedef vector < PLL > VLL ;
typedef vector < char > VC ;
typedef vector < string > VS ;
typedef map < ll ,ll > MLL ;
typedef map < char,ll > MCL;
typedef map < ll,char > MLC;
typedef map < string,ll> MSL;
typedef priority_queue < PLL > PQLL ;
typedef priority_queue < ll > PQL ;
typedef stack < ll > SKL ;
typedef stack < PLL > SKLL ;
typedef queue < ll > QL ;
typedef queue < PLL > QLL ;
typedef set < ll > SL ;
typedef set < PLL > SLL ;
typedef set < char > SC ;
 
string numtostr(ll n) {
     OS str1 ;
     str1 << n ;
     return str1.str();
}
ll strtonum(string s) {
     ll x ;
     SS str1(s);
     str1 >> x ;
     return x ;
}
ll GCD(ll a, ll b) {
    if ( b == 0 ) return a ;
    else return GCD(b,a%b);
}
ll LCM(ll a , ll b) {
    ll gcd = GCD(a,b);
     return (a/gcd)*b ;
}
ll cnt;
VL visited ;
VL adj[10005];
void dfs(ll node) {
     if (visited[node]) return ;
     cnt++ ;
     visited[node] = 1 ;
     if ( adj[node].size() > 0 ) {
         INC(i,0,adj[node].size()-1) {
             if ( !visited[adj[node][i]]) dfs(adj[node][i]);
         }
     }
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t ;
    scanf("%lld",&t);
    while(t--) {
        ll n,m,l ;
        scanf("%lld %lld %lld",&n,&m,&l);
        visited.resize(n+5,0);
        INC(i,0,m-1) {
            ll a,b ;
            scanf("%lld %lld",&a,&b);
            adj[a].PB(b);
        }
        VL query ;
        ll sum = 0 ;
        INC(i,0,l-1) {
            cnt = 0 ;
            ll a ;
            scanf("%lld",&a);
            if (!visited[a]) dfs(a);
            sum += cnt ;            
        }
        printf("%lld\n",sum);
        visited.clear();
        INC(i,0,10004) adj[i].clear();
    }
 
    return 0 ;
}