#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int n,m,k;bool vs[N];
int u[N],v[N];int du[N],p[N];
void solve(){
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=k;i++)vs[i]=du[i]=0,p[i]=i;
    for(int i=1;i<=n;i++){
        int x;scanf("%d",&x);vs[x]=1;
    }
    for(int i=1;i<=m;i++){
        scanf("%d%d",u+i,v+i);
        if(vs[u[i]]&&!vs[v[i]])du[v[i]]++;
        if(vs[v[i]]&&!vs[u[i]])du[u[i]]++;
    }
    sort(p+1,p+k+1,[](int x,int y){return du[x]>du[y];});
    int ans=0;
    for(int i=1;i<=10;i++)if(!vs[p[i]])for(int j=i+1;j<=10;j++)if(!vs[p[j]]){
        vs[p[i]]=vs[p[j]]=1;int c=0;
        for(int k=1;k<=m;k++)c+=vs[v[k]]&&vs[u[k]];
        vs[p[i]]=vs[p[j]]=0;ans=max(ans,c);
    }
    printf("%d\n",ans);
}
int main(){
    // freopen("in","r",stdin);
    int T;scanf("%d",&T);
    while(T--)solve();
    return 0;
}