#include <iostream>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
#define endl '\n'
const ll maxn=2e5+10;
struct node{
    ll x;
    ll cnt;
    bool operator<(const node &b)const{
        return cnt>b.cnt;
    }
}a[maxn];
struct edge{
    ll u,v;
    bool operator<(const edge &b)const{
        return u<b.u;
    }
};

map<edge,ll> mp;
bool fri[maxn];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll t;
    cin>>t;
    while(t--){
        ll n,m,k;
        cin>>n>>m>>k;
        for(ll i=1;i<=k;i++){
            fri[i]=false;
            a[i].cnt=0;
        }
        mp.clear();
        for(ll i=1;i<=n;i++){
            ll temp;
            cin>>temp;
            fri[temp]=true;
        }
        ll ans=0;
        vector<pair<ll,ll>> vp;
        for(ll i=1;i<=m;i++){
            ll x,y;
            cin>>x>>y;
            if(fri[x]&&fri[y]){
                ans++;
            }
            if((!fri[x])&&fri[y]){
                a[x].cnt++;
            }
            if(fri[x]&&(!fri[y])){
                a[y].cnt++;
            }
            if((!fri[x])&&(!fri[y])){
                
                if(x>y) swap(x,y);
                vp.push_back({x,y});
                
            }
        }
        for(auto it:vp){
            ll x=it.first,y=it.second;
            if(mp.find({x,y})!=mp.end()){
                mp[{x,y}]++;
            }
            else{
                mp[{x,y}]=a[x].cnt+a[y].cnt;
            }
        }
        sort(a+1,a+1+k);
        ll mx=0;
        for(auto it:mp){
            mx=max(mx,it.second);
        }
        ans+=max(a[1].cnt+a[2].cnt,mx);
        cout<<ans<<endl;
    }


    return 0;
}