#include <bits/stdc++.h>
using namespace std;
#define maxn 200005
vector<int>g[maxn];
int f[maxn];
int cal[maxn];
map<int,int>mp[maxn];

void solve(){
    int n,m,k;cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        int x;cin>>x;
        f[x]=1;
    }
    for(int i=1;i<=m;i++){
        int a,b;cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
        mp[a][b]++;
        mp[b][a]++;
    }
    int tmp=0;
    int mx=0;
    for(int i=1;i<=k;i++){
        if(f[i]){
            for(auto v:g[i]){
                if(f[v]){
                    tmp++;
                }
                else{
                    cal[v]++;
                }
            }
        }
    }
    tmp/=2;
    int ans=tmp;
    for(int i=1;i<=k;i++){
        if(f[i])continue;
        int res=tmp+cal[i];
        ans=max(res,ans);
        for(auto v:g[i]){
            if(f[v])continue;
            //cout<<"i v="<<i<<' '<<v<<'\n';
            ans=max(ans,tmp+mp[i][v]+cal[v]+cal[i]);
        }
    }
    if(k>=2){
        sort(cal+1,cal+1+k);
        ans=max(ans,tmp+cal[k]+cal[k-1]);
    }
    cout<<ans<<'\n';
    for(int i=1;i<=k;i++){
        mp[i].clear();
        g[i].clear();
        f[i]=cal[i]=0;
    }

}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TT=1;cin>>TT;
    while(TT--){
        solve();
    }
}