#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=2.1e5;
inline LL read(){
	LL x=0,ff=1;
	char c=getchar();
	while(!isdigit(c)&&c!='-') c=getchar();
	if(c=='-') c=getchar(),ff=-1;
	while(isdigit(c)) x=x*10ll+c-'0',c=getchar();
	return x*ff;
}
int n,m,K;
#define pii pair<int,int> 
#define mk make_pair
#define x first
#define y second
bool flg[N];
pii e[N];
int val[N];
map<pii,int> ha;
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int casecnt=read();
	while(casecnt--){
		int ans=0,sum=0;
		ha.clear();
		K=read(),m=read(),n=read();
		for(int i=1;i<=n;++i)
			flg[i]=0,val[i]=0;
		for(int i=1;i<=K;++i)
			flg[read()]=1;
		for(int i=1;i<=m;++i){
			e[i].x=read(),e[i].y=read();
			if(flg[e[i].x]&&flg[e[i].y]) ++sum;
			else if(flg[e[i].x]) val[e[i].y]++; 
			else if(flg[e[i].y]) val[e[i].x]++;
			else if(e[i].x==e[i].y) val[e[i].x]++;
			else ha[e[i]]++;
		}
		int maxn=0,cmaxn=0;
		for(int i=1;i<=n;++i)
			if(!flg[i]){
				if(val[i]>maxn)
					cmaxn=maxn,maxn=val[i];
				else if(val[i]>cmaxn)
					cmaxn=val[i];
			}
		ans=maxn+cmaxn;
		for(int i=1;i<=m;++i)
			if(!flg[e[i].x]&&!flg[e[i].y])
				ans=max(ans,val[e[i].x]+val[e[i].y]+ha[e[i]]);
		printf("%d\n",ans+sum);
	} 
	return 0;
}