#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=1e6+3;
int n,m,k,f[N];
bool vis[N];
vector<int>ve[N];
void Solve()
{
	cin>>k>>m>>n;int ans=0;
	for(int i=1;i<=n;i++)f[i]=vis[i]=0,ve[i].clear();
	for(int i=1,x;i<=k;i++)cin>>x,vis[x]=1;
	for(int i=1,x,y;i<=m;i++)cin>>x>>y,ans+=vis[x]&&vis[y],ve[x].push_back(y),ve[y].push_back(x);
	for(int i=1;i<=n;i++)if(!vis[i])for(int j:ve[i])f[i]+=vis[j]||i==j;
	int mx1=0,mx2=0,res=0;
	for(int i=1;i<=n;i++)if(!vis[i])
	{
		if(mx1<=f[i])mx2=mx1,mx1=f[i];
		else if(mx2<=f[i])f[i]=mx2;
	}
	res=mx1+mx2;
	for(int i=1;i<=n;i++)if(!vis[i])for(int j:ve[i])if(!vis[j]&&i!=j)res=max(res,f[i]+f[j]+1);
	cout<<res+ans<<"\n";
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;cin>>T;
	while(T--)Solve();
}