#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define MAXN 200005
#define endl '\n'
vector<ll> e[MAXN];
ll a[MAXN], v[MAXN], u[MAXN];
struct node {
	ll x, id;
} b[MAXN];
bool cmp(node a, node b)
{
	return a.x < b.x;
}
void solve()
{
	int n, m, k;
	cin >> n >> m >> k;
	
	for (int i = 1; i <= k; i++) {
		a[i] = 0;
	}
	
	map<int, int> mp;
	for (int i = 1; i <= n; i++) {
		int t;
		cin >> t;
		mp[t]++;
	}
	
	ll ans = 0;
	map<pair<ll, ll>, ll> kind;
	for (int i = 1; i <= m; i++) {
		cin >> u[i] >> v[i];
		
		if (mp[u[i]] && mp[v[i]]) {
			ans++;
		} else if (mp[u[i]]) {
			a[v[i]]++;
		} else if (mp[v[i]]) {
			a[u[i]]++;
		} else {
			if (u[i] == v[i]) {
				e[u[i]].push_back(v[i]);
				kind[{u[i], v[i]}]++;
			} else {
				e[u[i]].push_back(v[i]);
				e[v[i]].push_back(u[i]);
				kind[{u[i], v[i]}]++;
				kind[{v[i], u[i]}]++;
			}
		}
	}
	
	int cnt = 0;
	for (int i = 1; i <= k; i++) {
		if (mp[i] == 0) {
			b[++cnt].x = a[i] + kind[{i, i}];
			b[cnt].id = i;
		}
	}
	
	sort(b + 1, b + cnt + 1, cmp);
	
	ll res = 0;
	for (int i = 1; i <= k; i++) {
		if (mp[i]) {
			continue;
		}
		
		map<int, int> st;
		for (int k = 0; k < e[i].size(); k++) {
			int j = e[i][k];
			
			if (j == i) {
				res = max(res, a[i] + kind[{i, i}]);
			} else {
				res = max(res, a[i] + a[j] + kind[{i, i}] + kind[{i, j}] + kind[{j, j}]);
			}
			
			st[j]++;
		//	cout << i << ' ' << j << " " << a[i] + a[j] + kind[{i, i}] + kind[{j, i}] + kind[{i, j}] + kind[{j, j}] << endl;
		}
		st[i]++;
		
		ll t = 0;
		for (int k = cnt; k >= 1; k--) {
			if (!st[b[k].id]) {
				t = b[k].x;
				break;
			}
		}
		st.clear();
		
		res = max(res, a[i] + kind[{i, i}] + t);
	}
	
	res += ans;
	
	cout << res << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	
	
	return 0;
}