#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'


void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    int f[n+1];
    vector<int > vis(k+1,0);
    for(int i=1;i<=n;i++){
        cin>>f[i];
        vis[f[i]]=1;
    }
    vector<vector<int > > edge(k+1);
    for(int i=1;i<=m;i++){
        int u,v;
        cin>>u>>v;
        if(u!=v){
            edge[u].push_back(v);
        }
        edge[v].push_back(u);
    }
    ll ans=0;
    for(int i=1;i<=k;i++){
        for(auto t:edge[i]){
            if(vis[i]==1&&vis[t]==1){
                ans++;
            }
        }
    }
    ans/=2;
    // cout<<ans<<endl;
    vector<int > val(k+1,0);
    for(int i=1;i<=k;i++){
        if(vis[i]==1){
            continue;
        }
        for(auto t:edge[i]){
            if(vis[t]==1){
                val[i]++;
            }else if(t==i){
                val[i]++;
            }
        }
    }
    vector<map<int ,int > > mp(k+1);
    // vector<priority_queue<int ,vector<int > ,greater<int  > > > Q(k+1);
    for(int i=1;i<=k;i++){
        if(vis[i]==1){
            continue;
        }
        for(auto t:edge[i]){
            if(vis[t]==1){
                continue;
            }
            if(t==i){
                continue;
            }
            mp[i][t]++;
        }
    }
    int res=0;
    vector<int > mx;
    for(int i=1;i<=k;i++){
        if(vis[i]==1){
            continue;
        }
        mx.push_back(val[i]);
        for(auto t:edge[i]){
            if(vis[t]==1){
                continue;
            }
            if(t==i){
                continue;
            }
            int st=val[t]+mp[i][t]+val[i];
            // cout<<st<<" ";
            // cout<<i<<" "<<t<<" "<<val[i]<<" "<<val[t]<<endl;
            res=max(res,st);
        }
        // if(!Q[i].empty()){
        //     int st=val[i]+Q[i].top();
        //     res=max(res,st);
        // }else{
        //     res=max(res,val[i]);
        // }
    }
    sort(mx.begin(),mx.end(),greater<int > ());
    int sum=0;
    for(int i=0;i<min((int)mx.size(),2);i++){
        sum+=mx[i];
    }
    res=max(res,sum);
    ans+=res;
    cout<<ans<<endl;

}

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