#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
	int n,k,m;
	cin>>n>>m>>k;
	vector<int>fri(k+1);
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		fri[x]=1;
	}
	int sum=0;
	vector<int>c(k+1);
	map<pair<int,int>,int>mp;
	vector<pair<int,int>>v(m+1);
	for(int i=1;i<=m;i++){
		int a,b;cin>>a>>b;
		v[i]={a,b};
		if(fri[a]&&fri[b])sum++;
		else if(fri[a]){
			c[b]++;
		}else if(fri[b]){
			c[a]++;
		}else{
			if(a>b)swap(a,b);
			mp[{a,b}]++;
		}
	}
	int ans=sum;
	for(int i=1;i<=m;i++){
		int a=v[i].first,b=v[i].second;
		if(fri[a]&&fri[b]);
		else if(fri[a]){
		   if(mp.count({b,b}))
		   ans=max(ans,c[b]+sum+mp[{b,b}]);
			else ans=max(ans,c[b]+sum);
		}else if(fri[b]){
			if(mp.count({a,a}))
			ans=max(ans,c[a]+sum+mp[{a,a}]);
			else ans=max(ans,c[a]+sum);
		}else{
			if(a>b)swap(a,b);
			int cnt=sum;
			if(mp.count({a,a}))cnt+=mp[{a,a}];
			if(a!=b&&mp.count({b,b}))cnt+=mp[{b,b}];
			if(a!=b)cnt+=mp[{a,b}];
			ans=max(ans,c[a]+c[b]+cnt);
		}
	}
	sort(c.begin()+1,c.end());
	ans=max(ans,sum+c[k]+c[k-1]);
	cout<<ans<<'\n';
	
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
}