#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<int>cnt(k + 1), mx(k + 1), vis(k + 1), id(k + 1);
	vector<vector<int>>e(k + 1);
	vector<map<int, int>>mp(k + 1);
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		vis[x] = 1;
	}
	int ans = 0;
	int mx1 = 0, id1 = 0, mx2 = 0, id2 = 0;
	for (int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		if (vis[x] && vis[y]) {
			ans++;
			continue;
		}
		if (x == y) {
			cnt[x]++;
			if (mx1 == 0) {
				mx1 = cnt[x];
				id1 = x;
			} else if (mx1 < cnt[x]) {
				mx1 = cnt[x];
				id1 = x;
			} else if (mx2 < cnt[x]) {
				mx2 = cnt[x];
				id2 = x;
			}
			continue;
		}
		if (vis[x]) {
			cnt[y]++;
			if (mx1 == 0) {
				mx1 = cnt[y];
				id1 = y;
			} else if (mx1 < cnt[y]) {
				mx1 = cnt[y];
				id1 = y;
			} else if (mx2 < cnt[y]) {
				mx2 = cnt[y];
				id2 = y;
			}
		} else if (vis[y]) {
			cnt[x]++;
			if (mx1 == 0) {
				mx1 = cnt[x];
				id1 = x;
			} else if (mx1 < cnt[x]) {
				mx1 = cnt[x];
				id1 = x;
			} else if (mx2 < cnt[x]) {
				mx2 = cnt[x];
				id2 = x;
			}
		} else {
			e[x].pb(y);
			e[y].pb(x);
			mp[x][y]++;
			mp[y][x]++;
		}
	}
	int res = 0;
	for (int i = 1; i <= k; i++) {
		int idx = 0;
		map<int, int>c2;
		for (auto x : e[i]) {
			c2[x]++;
		}
		for (auto [x, y] : c2) {
			res = max(res, cnt[i] + cnt[x] + mp[x][y]);
		}
	}

	for (int i = 1; i <= k; i++) {
		if (vis[i])
			continue;
		if (i == id1)
			res = max(res, cnt[i] + mx2 + mp[i][id2]);
		else
			res = max(res, cnt[i] + mx1 + mp[i][id1]);
	}
	cout << ans + res << '\n';
}

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