#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
#define int long long
#define pb push_back
#define endl '\n'
void solve() {
	int n, m, k; cin >> n >> m >> k;
	map<int, int>mp, vis;//, cnt1;
	map<PII, int>chong;
	vector<vector<int>>g(k + 2);
	for(int i = 1; i <= n; i++){
		int x; cin >> x;
		mp[x] = 1;
	}
	int ret = 0;
	for(int i = 1; i <= m; i++){
		int u, v; cin >> u >> v;
		chong[{u, v}]++, chong[{v, u}]++;
		g[u].pb(v), g[v].pb(u);
		if(mp[u] && mp[v])ret++;
		else if(mp[u])vis[v]++;//, cnt1[u]++;
		else if(mp[v])vis[u]++;//, cnt1[v]++;
	}
	int d1 = -1, d2 = -1;
	// for(auto [x, y]:cnt1){
	// 	if(y > d1)d2 = d1, d1 = y;
	// 	else if(y > d2)d2 = y;
	// }
	auto getAns = [&](int u, int v) -> int{
		return vis[u] + vis[v] + chong[{u, v}];
	};
	int cnt = 0;//max(0ll, d1) + max(0ll, d2);
	for(int i = 1 ; i <= k; i++){
		if(!mp[i]){
			// cout << i << '?' << vis[i] << ' ';
			if(vis[i] > d1)d2 = d1, d1 = vis[i];
			else if(vis[i] > d2)d2 = vis[i];
			for(auto to:g[i]){
				if(!mp[to]){
					cnt = max(cnt, getAns(i, to));
				}
			}
		}
	}
	// cout << endl;
	cnt = max(cnt, max(0ll, d1) + max(0ll, d2));
	// cout << d1 << ' ' << d2 <<endl;
	cout << cnt + ret << endl;
}

#undef int
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}