//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;typedef long double ld;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{

	ci N=200005;

	int n,m,K;
	bool vis[N];
	int val[N];
	vector<int> e[N];

	si void solve(){
		cin>>K>>m>>n;
		for(int i=1;i<=n;i++)vis[i]=false,e[i].clear(),val[i]=0;
		for(int i=1,x;i<=K;i++)cin>>x,vis[x]=true;

		int tot=0;
		for(int i=1,x,y;i<=m;i++){
			cin>>x>>y;
			if(vis[x]&&vis[y])tot++;
			else e[x].push_back(y),e[y].push_back(x);
		}

		if(K>=n-2)return cout<<m<<endl,void();

		pii mx(0,0),sx(0,0);
		for(int i=1;i<=n;i++){
			if(!vis[i]){
				for(int j:e[i])if(vis[j])val[i]++;
				if(val[i]>mx.fi)sx=mx,mx=pii(val[i],i);
				else if(val[i]>sx.fi)sx=pii(val[i],i);
			}
		}

		int ans=0;
		for(int i=1;i<=n;i++){
			if(vis[i])continue;
			int v=0;
			if(i==mx.se)v=sx.fi;
			else v=mx.fi;
			map<int,int> cur;
			for(int j:e[i])if(!vis[j])gmax(v,++cur[j]+val[j]);
			gmax(ans,tot+val[i]+v);
		}

		cout<<ans<<endl;
	}

	void mian(){
		int TT;cin>>TT;
		while(TT--)solve();
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	assert(freopen("in.in","r",stdin));
	assert(freopen("out.out","w",stdout));
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}