#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define MAXN 600005
#define endl '\n'
ll n,m,k;
ll a[MAXN],uu[MAXN],vv[MAXN],b[MAXN];
vector<ll>e[MAXN];
void solve()
{
	map<int,bool>frd;
	cin>>n>>m>>k;
	for(int i=1;i<=k;i++) a[i]=0,e[i].clear();
	for(int i=1;i<=n;i++){
		ll x;
		cin>>x;
		frd[x]=1;
	}
	ll ans=0;
	map<pair<ll,ll>,ll>kind;	
	for(int i=1;i<=m;i++){
		cin>>uu[i]>>vv[i];
		e[uu[i]].push_back(vv[i]);
		e[vv[i]].push_back(uu[i]);
		if(frd[uu[i]]&&frd[vv[i]]){
			ans++;
			continue;
		}
		kind[{uu[i],vv[i]}]++;
		if(frd[vv[i]]) a[uu[i]]++;
		if(frd[uu[i]]) a[vv[i]]++;
	}
	for(int i=1;i<=k;i++) b[i]=a[i];
	sort(b+1,b+k+1);
	
	ll tmp=0;
	for(int i=1;i<=k;i++){
		if(frd[i]) continue;
		ll jl=b[k];
		if(a[i]==b[k]) jl=b[k-1];
		tmp=max(tmp,a[i]+kind[{i,i}]+jl);
		for(int j=0;j<e[i].size();j++){
			ll v=e[i][j];
			if(frd[v]||i==v) continue;			
			ll res=a[i]+a[v]+kind[{i,v}]+kind[{v,i}]+kind[{i,i}]+kind[{v,v}];
	//		cout<<i<<" "<<v<<" "<<a[i]<<" "
			tmp=max(tmp,res);
		}	
	}
	cout<<ans+tmp<<endl;
	
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	
	
	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
 */