#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i)
#define For(i,j,k) for(int i=j;i>=k;--i)
const int N = 2e5 + 111;
int cnt[N];
int tmpcnt[N];
int mxpre[N];
int mxsuf[N];
int fri[N];
vector<int> e[N];
typedef pair<int,int> pii;
void sol(){
	int n,m,k;
	cin>>n>>m>>k;
	FOR(i,0,k+1) fri[i] = 0,e[i].clear(),mxsuf[i]=0,mxpre[i]=0,cnt[i]=0;
	FOR(i,1,n){
		int tmp;
		cin>>tmp;
		fri[tmp] = 1;
	}
	FOR(i,1,m){
		int x,y;
		cin>>x>>y;
		e[x].push_back(y);
		e[y].push_back(x);
	}
	if(n==k||n==k-1){
		cout<<m<<'\n';
	}
	else{
		int ans = 0;
		int presum = 0;
		FOR(i,1,k){
			if(!fri[i]){
				for(auto nxt:e[i]){
					if(fri[nxt]){
						++cnt[i];
					}
				}
			}
			else{
				for(auto nxt:e[i]){
					if(fri[nxt]){
						++ans;
					}
				}
			}
		}
		ans/=2;
		presum = ans;
		mxpre[0] = 0;
		mxsuf[k+1] = 0;
		FOR(i,1,k) mxpre[i] = max(mxpre[i-1],cnt[i]);
		For(i,k,1) mxsuf[i] = max(mxsuf[i+1],cnt[i]);
		FOR(i,1,k){
			int mx = 0;
			int es = 0;
			mx = max(mxpre[i-1],mxsuf[i+1]);
			if(!fri[i]){
				fri[i] = 1;
				for(auto nxt:e[i]){
					if(!fri[nxt]){
						tmpcnt[nxt] = cnt[nxt];
					}
				}
				for(auto nxt:e[i]){
					if(nxt==i) ++es;
					else{
						if(!fri[nxt]){
							++tmpcnt[nxt];
							mx = max(mx,tmpcnt[nxt]);
						}
					}
				}
				ans = max(ans,presum + es/2 + mx + cnt[i]);
				fri[i] = 0;
			}
		}
		cout<<ans<<'\n';
	}
}
signed main(){
//	freopen("1.in","r",stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		sol();
	}
	return 0;
}