#include <bits/stdc++.h>

#define ll long long

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

	std::vector<std::vector<int>> adj(n + 1);
	std::map<std::pair<int, int>, int> e;
	std::vector<int> self(n + 1);

	int init = 0;
	std::vector<int> sel(n + 1), forst(n + 1);
	for (int i = 0; i < k; i++){
		int f;
		std::cin >> f;
		sel[f] = 1;
	}

	for (int i = 0; i < m; i++){
		int a, b;
		std::cin >> a >> b;
		if (a == b){
			self[a]++;
			// std::cout << a << ' ' << b << "SSS\n";
		}else{
			adj[a].push_back(b);
			adj[b].push_back(a);
			if (a > b) {
				std::swap(a, b);
			}
			e[{a, b}]++;
		}
	}

	std::vector<std::pair<std::pair<int, int>, int>> edg(e.begin(), e.end());
	for (int i = 1; i <= n; i++){
		for (auto y : adj[i]){
			if (sel[y]){
				forst[i]++;
			}
		}
	}

	int ans = 0;

	for (auto [_, w] : edg){
		auto [x, y] = _;
		if (sel[x] && sel[y]){
			init++;
		}
	}
	for (int i = 1; i <= n; i++){
		if (sel[i]){
			init += self[i];
		}
	}

	std::vector<std::pair<int, int>> b;
	for (int i = 1; i <= n; i++){
		if (sel[i] == 0){
			b.push_back({forst[i], i});
		}
	}

	sort(b.begin(), b.end(), std::greater<>());
	ans = init;
	for (auto [_, w] : edg){
		auto [x, y] = _;
		// std::cout << x << ' '<< y << ' ' << w << '\n';
		if (sel[x] == 1 && sel[y] == 1) {
			continue;
		}
		int cur = 0;
		if (sel[x] == 0 && sel[y] == 0){
			cur += w;
			cur += self[x];
			cur += forst[x];
			cur += self[y];
			cur += forst[y];
			cur += init;
		}else{
			if (sel[x] == 0){
				cur += forst[x];
				cur += self[x];
				for (auto [val, idx] : b){
					if (idx != x){
						cur += val;
						cur += self[idx];
						break;
					}
				}
			}else{
				cur += forst[y];
				cur += self[y];
				for (auto [val, idx] : b){
					if (idx != y){
						cur += val;
						cur += self[idx];
						break;
					}
				}
			}
			cur += init;
		}
		ans = std::max(ans, cur);
	}

	std::cout << ans << '\n';
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t;
	std::cin >> t;

	while (t--){
		solve();
	}


	return 0;
}