#include<bits/stdc++.h>
using namespace std;
/*
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
*/
// #define int long long
#define ld long double
//#define INT __int128
#define eb(x) emplace_back(x)
#define fi first
#define se second
#define sc(x) scanf("%d",&x)
#define SC(x) scanf("%lld",&x)
#define reserve reserve
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<long long, long long> PLL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const ld eps = 1e-12;
const int N = 2e5 + 10, M = N + 10;
int n,m,k;
struct Edge{
    int u,v;
}edge[N];
bool is[N];
int d[N];
map<PII,int>mp;

void solve(){
    cin>>n>>m>>k;
    mp.clear();
    for(int i=1;i<=k;i++){
        d[i]=0,is[i]=0;
    }
    for(int i=1;i<=n;i++){
        int a;
        scanf("%d",&a);
        is[a]=1;
    }
    for(int i=1;i<=m;i++){
        scanf("%d%d",&edge[i].u,&edge[i].v);
    }
    int sm=0;
    for(int i=1;i<=m;i++){
        int u=edge[i].u,v=edge[i].v;
        if(is[u]&&is[v]){
            sm++;
        }
        else if(is[u]||is[v]){
            if(!is[u]){
                d[u]++;
            }
            else if(!is[v]){
                d[v]++;
            }
        }
        else{
            mp[{u,v}]++;
            if(u!=v)
                mp[{v,u}]++;
        }
    }

    int mx1=0,mx2=0;
    for(int i=1;i<=k;i++){
        if(d[i]+mp[{i,i}]>mx1){
            mx2=mx1;
            mx1=i;
        }
        else if(d[i]+mp[{i,i}]>mx2){
            mx2=i;
        }
    }

    // cout<<"_____________"<<sm<<endl;
    // for(int i=1;i<=k;i++){
    //     cout<<d[i]<<endl;
    // }
    // cout<<endl;

    // cout<<mp[{1,1}]<<" "<<mp[{4,1}]<<" "<<d[1]<<" "<<d[4]<<endl;

    int ans=sm;
    for(int i=1;i<=m;i++){
        int u=edge[i].u,v=edge[i].v;
        if(!is[u]&&!is[v]){
            // cout<<"_______"<<u<<" "<<v<<endl;
            if(u==v){
                ans=max(ans,d[u]+sm+mp[{u,u}]);
            }
            else{
                ans=max(ans,d[u]+d[v]+sm+mp[{v,v}]+mp[{u,u}]+mp[{u,v}]);
            }
        }
        else if(!is[u]||!is[v]){
            if(!is[u]){
                // cout<<"++++++ "<<u<<endl;
                ans=max(ans,d[u]+sm+mp[{u,u}]);
            }
            else{
                 // cout<<"++++++ "<<u<<endl;
                ans=max(ans,d[v]+sm+mp[{v,v}]);
            }   
        }
        // cout<<"=============  " <<u<<" "<<v<<" "<<ans<<endl;
    }
    ans=max(ans,d[mx1]+d[mx2]+sm+mp[{mx1,mx1}]+mp[{mx2,mx2}]+mp[{mx1,mx2}]);
    cout<<ans<<endl;
}

signed main(){
    // ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int T=1,cas=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}