#include<bits/stdc++.h>
#define pa pair<int,int>
#define INF 0x3f3f3f3f
#define inf 0x3f
#define fi first
#define se second
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define pb push_back

using namespace std;

inline ll read()
{
	ll f=1,sum=0;char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-1;c=getchar();}
	while (isdigit(c)) {sum=sum*10+c-'0';c=getchar();}
	return sum*f;
}
const int MAXN=200010;
pa es[MAXN];
bool vis[MAXN];
int num[MAXN];
map <pa,int> show;
int main()
{
	int T=read();
	while (T--)
	{
		int n=read(),m=read(),k=read();
		for (int i=1;i<=n;i++) vis[read()]=1;
		int pre=0;
		for (int i=1;i<=m;i++)
		{
			int u=read(),v=read();
			es[i]=mp(u,v);
			if (vis[u] && vis[v]) pre++;
			else if (vis[u]) num[v]++;
			else if (vis[v]) num[u]++; 
			else if (u==v) num[u]++;
			else show[mp(min(u,v),max(u,v))]++;
		}
		int mx=0,mxid,sec=0,secid;
		for (int i=1;i<=k;i++)
		{
			if (vis[i]) continue;
			if (num[i]>mx) mx=num[i],mxid=i;
			else if (num[i]>sec) sec=num[i],secid=i;
		}
		// cout<<pre<<endl;
		int ans=0;
		for (int i=1;i<=m;i++)
		{
			if (vis[es[i].fi] && vis[es[i].se]) continue;
			int now=0;
			if (vis[es[i].fi]) {
				now+=num[es[i].se];
				int choose;
				if (es[i].se!=mxid) choose=mxid,now+=mx;
				else choose=secid,now+=sec;
			}
			else if (vis[es[i].se])
			{
				now+=num[es[i].fi];
				int choose;
				if (es[i].fi!=mxid) choose=mxid,now+=mx;
				else choose=secid,now+=sec;
			}
			else
			{
				now+=show[mp(min(es[i].fi,es[i].se),max(es[i].fi,es[i].se))];
				// cout<<i<<':'<<now;
				now+=num[es[i].fi];
				if (es[i].fi!=es[i].se) now+=num[es[i].se];
				// cout<<' '<<now<<endl;
			}
			ans=max(ans,now);
			// cout<<i<<' '<<now<<endl;
		}
		cout<<ans+pre<<'\n';
		for (int i=1;i<=k;i++) vis[i]=num[i]=0;
		show.clear();
	}
	
	return 0;
}