#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> is(n + 1), forst(n + 1);
	for (int i = 0; i < k; i++){
		int f;
		std::cin >> f;
		is[f] = 1;
	}

	for (int i = 0; i < m; i++){
		int a, b;
		std::cin >> a >> b;
		if (a == b){
			self[a]++;
			adj[a].push_back(b);
			e[{a, b}]++;
		}else{
			adj[a].push_back(b);
			adj[b].push_back(a);
			if (a > b) {
				std::swap(a, b);
			}
			e[{a, b}]++;
		}
	}
	for (auto [_, val] : e){
		auto [x, y] = _;
		if (is[x] && is[y]){
			init += val;
		}
	}
	std::set<std::pair<int, int>, std::greater<>> q;
	std::vector<int> val(n + 1);

	for (int i = 1; i <= n; i++){
		if (is[i]) {
			continue;	
		}
		for (auto y : adj[i]){
			if (is[y]){
				val[i]++;
			}
		}
		q.insert({val[i], i});
	}
	int ans = init;
	for (int x = 1; x <= n; x++){
		if (is[x]) {
			continue;
		}
		q.erase({val[x], x});
		is[x] = 1;
		int cur = init;
		for (auto y : adj[x]){
			if (is[y]){
				cur++;
			}else{
				q.erase({val[y], y});
				val[y]++;
				q.insert({val[y], y});
			}
		}
		if (!q.empty()){
			cur += self[q.begin()->second];
			cur += q.begin()->first;
		}
		ans = std::max(ans, cur);
		for (auto y : adj[x]){
			if (!is[y]){
				q.erase({val[y], y});
				val[y]--;
				q.insert({val[y], y});
			}
		}
		is[x] = 0;
		q.insert({val[x], x});
	}

	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;
}