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

void solve(){
	map<pair<int,int>,int> mp;
	map<int,int> ma,mk;
	int n,k,m;
	map<pair<int,int>,int> :: iterator it;
	int x=0,y=0;
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++){
		int temp;
		scanf("%d",&temp);
		ma[temp]=1;
	}
	int sum=0;
	for(int i=1;i<=m;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		if(a==b){
			if(ma[a]==0){
				mk[a]++;
				if(mk[a]>=mk[x]&&a!=x){
					//printf("%d fuck %d\n",x,y);
					int tkp=x;
					x=a;
					y=tkp;
					//printf("%d fuck %d\n",x,y);
				}
			}
			else{
				sum++;
			}
			continue;
		}
		if(ma[a]==1&&ma[b]==1){
			sum++;
			continue;
		}
		else if(ma[a]==1&&ma[b]==0){
			mk[b]++;
			if(mk[b]>=mk[x]&&b!=x){
				//printf("%d fuck %d\n",x,y);
					int tkp=x;
					x=b;
					y=tkp;
					//printf("%d fuck %d\n",x,y);
				}
		}
		else if(ma[a]==0&&ma[b]==1){
			mk[a]++;
			if(mk[a]>=mk[x]&&a!=x){
				//printf("%d fuck %d\n",x,y);
					int tkp=x;
					x=a;
					y=tkp;
					//printf("%d fuck %d\n",x,y);
				}
		}
		else{
			if(a>b){
			  swap(a,b);	
			}
			mp[{a,b}]++;
		}
	}
	if(n>=k-2){
		printf("%d\n",m);
		return; 
	}
	int ans=0;
    for(it=mp.begin();it!=mp.end();it++){
    	//printf("fuck\n");
    	int zong=mk[(it->first).first]+mk[(it->first).second]+(it->second);
    	 
    	ans=max(ans,zong);
    	//printf("%d asdkjasd\n",ans);
	}
	if(x>y){
		swap(x,y);
	}
   ans=max(ans,mk[x]+mk[y]+mp[{x,y}]);
  // printf("%d fuck %d fuck %d %d\n",ans,sum,x,y);
	printf("%d\n",sum+ans);
	
	
}


int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		solve();
	}
}