#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <ctime>
#include <cstdio>
#include <random>
#include <vector>
#include <bitset>
#include <cassert>
#include <cstring>
#include <algorithm>
#define fi first
#define se second
#define MISAKA main
#define ll long long
#define eb emplace_back
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define _rep(i,a,b) for(int i=a;i>=b;--i)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define FIO(FILE) freopen(FILE".in","r",stdin),freopen(FILE".out","w",stdout)
using namespace std;
inline int read(){
    char ch=getchar();int f=1,x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return x*f;
}
const int N=2e5+10,mod=998244353;
int n,k,m,w[N],vis[N];
vector<int> g[N];map<int,int> cnt[N];
void misaka(){
    rep(i,1,k) vis[i]=w[i]=0,g[i].clear(),cnt[i].clear();
    n=read(),m=read(),k=read();
    rep(i,1,n) vis[read()]=1;
    int c=0;
    rep(i,1,m){
        int u=read(),v=read();
        if(u==v) w[u]++,c+=vis[u];
        else{
            g[u].eb(v),g[v].eb(u);
            c+=vis[u]&&vis[v];
            cnt[u][v]++,cnt[v][u]++;
        }
    }
    rep(i,1,k)if(vis[i])
        for(int j:g[i])if(!vis[j]) w[j]++;
    int ans=0;
    rep(i,1,k)if(!vis[i])for(int j:g[i])if(!vis[j])
        ans=max(ans,c+w[i]+w[j]+cnt[i][j]);
    sort(w+1,w+k+1,[](int x,int y){return x>y;});
    ans=max(ans,c+w[1]+w[2]);
    printf("%d\n",ans);
}
signed MISAKA(){
    int T=read();
    while(T--) misaka();
    return 0;
}