#include <bits/stdc++.h>

using namespace std;

void solve()
{
	int n, m, k;
	cin >> n >> m >> k;

	vector<int> fri(k + 10), cnta(k + 10);

	for(int i = 0; i < n; i ++) {
		int x;
		cin >> x;
		fri[x] = 1;
	}

	vector<pair<int,int>> mesa, mesb;

	int cnt = 0;

	for(int i = 0; i < m; i ++) {
		int x, y;
		cin >> x >> y;

		if(fri[x] && fri[y]) {
			// cout << x << ' ' << y << endl;
			cnt ++;
		} else if(fri[x] || fri[y]) {
			mesa.push_back({x, y});
		} else if(x == y) {
			mesa.push_back({x, y});
		} else mesb.push_back({x, y});
	}
	// cout << mesb.size() << ' ';

	// cout << cnt << endl;

	if(n == k || n == k - 1) {
		cout << m << '\n';
		return;
	}

	for(int i = 0; i < mesa.size(); i ++) {
		int x = mesa[i].first, y = mesa[i].second;
		if(x == y) cnta[x] ++;
		else {
			if(fri[x] == 0) cnta[x] ++;
			if(fri[y] == 0) cnta[y] ++;
		}
		
	}

	// for(int i = 1; i <= k; i ++) cout << cnta[i] << ' ';cout << endl;

	vector<unordered_map<int, int>> sec(k + 10);

	for(int i = 0; i < mesb.size(); i ++) {
		int x = mesb[i].first, y = mesb[i].second;
		sec[x][y] ++;
		sec[y][x] ++;
		// cout << x << ' ' << y << endl;
	}

	if(mesb.empty()) {
		sort(cnta.begin(), cnta.end());
		cout << cnt + cnta.back() + cnta[cnta.size() - 2] << '\n';
		return;
	}

	int ans = 0;

	for(int i = 1; i <= k; i ++) {
		if(fri[i]) continue;
		for(auto s:sec[i]) {
			if(cnta[i] + cnta[s.first] + s.second > ans) {
				ans = cnta[i] + cnta[s.first] + s.second;
			}
		}
	}


	cout << ans + cnt << '\n';

}

int main()
{
	int t;
	cin >> t;

	while(t--)
		solve();

	return 0;
}