#include<bits/stdc++.h>
using namespace std;
int T;
int n,m,k;
int a[1000010],b[1000010];
bool vis[1000010];
int sum[1000010];
int nowsum,ans;
map<pair<int,int>,int> cnt;
int main()
{
    // freopen("j.out","w",stdout);
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&k),cnt.clear(),nowsum=ans=0;
        for(int i=1;i<=k;i++) sum[i]=0,vis[i]=0;
        for(int i=1;i<=n;i++)
        {
            int id;
            scanf("%d",&id);
            vis[id]=1;
        }
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d",&a[i],&b[i]);
            if(a[i]>b[i]) swap(a[i],b[i]);
            if(vis[a[i]]&&vis[b[i]])
            {
                nowsum++;
                continue;
            }
            if(a[i]==b[i]) sum[a[i]]++;
            else if(vis[a[i]]&&!vis[b[i]]) sum[b[i]]++;
            else if(!vis[a[i]]&&vis[b[i]]) sum[a[i]]++;
            else if(!vis[a[i]]&&!vis[b[i]]) cnt[make_pair(a[i],b[i])]++;
        }
        int max1=0,max2=0;
        for(int i=1;i<=k;i++)
        {
            if(max1<sum[i]) max2=max1,max1=sum[i];
            else if(max2<sum[i]) max2=sum[i];
        }
        ans=max1+max2+nowsum;
        for(int i=1;i<=m;i++) ans=max(ans,nowsum+sum[a[i]]+sum[b[i]]+cnt[make_pair(a[i],b[i])]);
        printf("%d\n",ans);
        // cerr<<"finish\n";
    }
    return 0;
}
/*
5
4 12 7
5 7 3 6
3 6
2 2
1 4
2 4
1 3
7 6
4 1
5 4
1 1
1 1
2 1
3 7
2 7 6
2 4
1 2
3 2
2 5
5 4
2 6
4 6
2 6
1 1 2
1
1 2
2 1 2
1 2
1 2
2 1 100
24 11
11 24
*/