#include <bits/stdc++.h>
using namespace std;
#define int long long
#define x first
#define y second
#define PII pair<int,int>
void solve()
{
	int n,m,k;
	cin>>k>>m>>n;
	vector<int>v(n+1),a(m+1),b(m+1),c(n+1);
	for(int i=1;i<=k;i++){
		int u;
		cin>>u;
		v[u]=1;
	}
	int cnt=0;
	map<PII,int>q;
	for(int i=1;i<=m;i++){
		cin>>a[i]>>b[i];
		if(a[i]==b[i]) c[a[i]]++;
		else if(v[a[i]]&&v[b[i]]) cnt++;
		else if(v[a[i]]){
			c[b[i]]++;
		}else if(v[b[i]]){
			c[a[i]]++;
		}else{
			if(a[i]>b[i])swap(a[i],b[i]);
			q[{a[i],b[i]}]++;
		}
	}
//	cout<<c[1]<<"        a";
	int ans=0;
	for(int i=1;i<=m;i++){
		if(!v[a[i]]&&!v[b[i]]){
			if(a[i]==b[i])  ans=max(ans,cnt+c[a[i]]);
			else ans=max(ans,cnt+c[a[i]]+c[b[i]]+q[{a[i],b[i]}]);
		}
	}
//	cout<<c[1]<<" ";
	vector<PII>d(n+1);
	for(int i=1;i<=n;i++){
		d[i].x=c[i];
		d[i].y=i;
	}
	sort(d.begin()+1,d.end());
	for(int i=n;i>=n-1;i--){
		cnt+=d[i].x;
	}
	int U=d[n].y,V=d[n-1].y;
	if(U>V) swap(U,V);
	if(n>=2) cnt+=q[{V,U}];
	ans=max(ans,cnt);
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T=1;
	cin>>T;
	while(T--)
	{
		solve();
	}
}