#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
using pii=pair<int,int>;

void solve() {
    int n,m,k; cin>>n>>m>>k;
    set<int> fri;
    for(int i=0; i<n; i++) {
        int x; cin>>x;
        fri.insert(x);
    }

    int ans=0;
    map<int,int> mp;
    map<pii,int> mp2;
    while(m--) {
        int a,b; cin>>a>>b;
        if(fri.count(a)&&fri.count(b)) ans++;
        else if(a==b) mp[a]++;
        else if(fri.count(a)) mp[b]++;
        else if(fri.count(b)) mp[a]++;
        else mp2[{min(a,b),max(a,b)}]++;
    }

    if(mp2.size()==0) {
        vector<int> v;
        for(auto [x,y]:mp)
            v.push_back(y);

        sort(v.begin(),v.end(),greater());
        if(v.size()>0) ans+=v[0];
        if(v.size()>1) ans+=v[1];
    }
    else {
        int maxx=0;
        for(auto [x,y]:mp2) {
            int xx=x.first,yy=x.second;
            maxx=max(maxx,y+mp[xx]+mp[yy]);
        }
        ans+=maxx;
    }

    cout<<ans<<endl;

}

signed main() {
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);

    int t; cin>>t;
    while(t--)
        solve();
}