#include <cstdio>
#include <map>

const int N = 200000;
int n, m, k, val[N];
bool fr[N];
std::map<std::pair<int, int>, int> edg;

int main() {
	int tt;
	scanf("%d", &tt);
	while (tt--) {
		edg.clear();
		scanf("%d%d%d", &n, &m, &k);
		for (int i = 0; i < k; ++i) val[i] = fr[i] = 0;
		for (int i = 0; i < n; ++i) {
			int f;
			scanf("%d", &f);
			--f;
			fr[f] = 1;
		}
		for (int i = 0; i < m; ++i) {
			int a, b;
			scanf("%d%d", &a, &b);
			--a;
			--b;
			++edg[std::make_pair(std::min(a, b), std::max(a, b))];
			if (fr[a]) ++val[b];
			if (fr[b]) ++val[a];
			if (a == b) ++val[a];
		}
		int mx = 0, mx1 = 0;
		for (int i = 0; i < k; ++i) if (!fr[i]) {
			if (mx < val[i]) {
				mx1 = std::max(mx1, mx);
				mx = val[i];
			} else if (mx1 < val[i]) mx1 = val[i];
		}
		int ans = mx + mx1, add = 0;
		for (auto a : edg) {
			if (a.first.first != a.first.second) {
				if (!fr[a.first.first] && !fr[a.first.second]) {
					ans = std::max(ans, val[a.first.first] + val[a.first.second] + a.second);
				}
				if (fr[a.first.first] && fr[a.first.second]) ans += a.second;
			} else {
				if (fr[a.first.first]) add += a.second;
			}
		}
		printf("%d\n", ans + add);
	}
	return 0;
}