#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
using namespace std;
int main() {
#ifdef LOCAL
	freopen("test.in", "r", stdin);
#endif 
	int T;
	cin >> T;
	while (T--) {
		int n, m, k;
		cin >> n >> m >> k;
		vector<int> mark(k + 1), w(k + 1);
		vector<vector<int>> post(k + 1);
		map<pair<int, int>, int> mp;
		mp.clear();
		for (int i = 1; i <= k; i++) {
			mark[i] = 0;
			w[i] = 0;
			post[i].clear();
		}
		for (int i = 1; i <= n; i++) {
			int f;
			cin >> f;
			mark[f] = 1;
		}
		int fans = 0;
		for (int i = 1; i <= m; i++) {
			int a, b;
			cin >> a >> b;
			post[b].push_back(a);
			mp[make_pair(b, a)]++;
			w[b] += mark[a];
			w[a] += mark[b];
			if (mark[a] && mark[b]) {
				fans++;
			}
		}
		int mx = -1, smx = -1;
		for (int i = 1; i <= k; i++) {
			if (!mark[i]) {
				if (mx == -1 || w[mx] < w[i]) smx = mx, mx = i;
				else if (smx == -1 || w[smx] < w[i]) smx = i;
			}
		}
		for (int i = 1; i <= k; i++) {
			w[i] += mp[make_pair(i, i)];
		}
		// for (int i = 1; i <= k; i++) cout << w[i] << " ";
		// cout << "\n";
		int ans = 0;
		for (int i = 1; i <= k; i++) if (!mark[i]) {
			for (int j : post[i]) if (j != i) {
				if (mark[j]) {
					ans = max(ans, w[i]);
				} else {
					ans = max(ans, w[i] + w[j] + mp[make_pair(j, i)] + mp[make_pair(i, j)]);
				}
				
			}
			if (i == mx) {
				if (smx != -1){
					ans = max(ans, w[i] + w[smx]);
				}
				
			} else {
				if (mx != -1)
					ans = max(ans, w[i] + w[mx]);
			}
		}
		cout << ans + fans << "\n";
	}
	return 0;
}