#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

namespace IO {
	inline ll rd() {
		char ch = getchar();
		ll s = 0, w = 1;
		while (ch < '0' || ch > '9') {
			if (ch == '-') w = -1;
			ch = getchar();
		}
		while (ch >= '0' && ch <= '9') {
			s = (s << 3) + (s << 1) + (ch ^ 48);
			ch = getchar();
		}
		return (s * w);
	}
	void wr(ll x) {
		if (x < 0) {
			putchar('-');
			x = -x;
		}
		if (x <= 9) {
			putchar(x + 48);
			return;
		}
		wr(x / 10);
		putchar(x % 10 + 48);
	}
}
using namespace IO;

constexpr ll fn = 5e5;
constexpr ll N = fn + 10;

ll T, n, m, k;
bool b[N];
map<pair<ll, ll>, ll> mp;
ll f[N], g[N];
ll cnt, ans, U[N], V[N];

int main() {
	T = rd();
	while (T--) {
		n = rd(), m = rd(), k = rd();
		fill(b + 1, b + k + 1, 0);
		fill(f + 1, f + k + 1, 0);
		for (ll i = 1; i <= n; ++i) {
			b[rd()] = 1;
		}
		mp.clear();
		cnt = 0;
		for (ll i = 1; i <= m; ++i) {
			U[i] = rd(), V[i] = rd();
			if (b[U[i]] && b[V[i]]) {
				++cnt;
			}
			else if (!b[U[i]] && b[V[i]]) {
				++f[U[i]];
			}
			else if (b[U[i]] & !b[V[i]]) {
				++f[V[i]];
			}
			else {
				if (U[i] == V[i]) {
					++f[U[i]];
				}
				else {
					++mp[{U[i], V[i]}];
				}
			}
		}

		copy(f + 1, f + k + 1, g + 1);
		ll val = exchange(*max_element(g + 1, g + k + 1), 0);
		val += *max_element(g + 1, g + k + 1);
		ans = val;
		for (ll i = 1; i <= m; ++i) {
			ans = max(ans, f[U[i]] + f[V[i]] + mp[{U[i], V[i]}]);
		}
		ans += cnt;

		wr(ans), putchar('\n');
	}
	return 0;
}