#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+10,INF = 1e9;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int T,n,m,k;
int vis[N],w[N],sum,ans;
map<int,int> f[N];

multiset<int> S;

void solve(){
    cin>>n>>m>>k;
    for(int i=1;i<=k;i++)vis[i] = 0,f[i].clear();
    sum = ans = 0;
    for(int i=1,x;i<=n;i++)cin>>x,vis[x] = 1;
    for(int i=1,u,v;i<=m;i++){
        cin>>u>>v;
        f[u][v]++,f[v][u]++;
        sum += vis[u] && vis[v];
    }
    S.clear();
    for(int i=1;i<=k;i++)if(!vis[i]){
        w[i] = 0;
        for(auto [j,c] : f[i])if(vis[j] || i==j)w[i] += c;
        tomax(ans,w[i]);
        S.insert(w[i]);
    }
    for(int i=1;i<=k;i++)if(!vis[i]){
        S.erase(S.find(w[i]));
        for(auto [j,c] : f[i])if(!vis[j] && i!=j){
            tomax(ans,w[i] + w[j] - c);
            S.erase(S.find(w[j]));
        }
        if(S.size()){
            int mx = *S.rbegin();
            tomax(ans,w[i] + mx);
        }
        S.insert(w[i]);     
        for(auto [j,c] : f[i])if(!vis[j] && i!=j)S.insert(w[j]);
    }
    cout<<sum+ans<<"\n";
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>T;
    while(T--)solve();

    return 0;
}