//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;

int n, m, k, g[_];

bool vis[_];

vi d[_];

map<int, int> mp[_];

vector<pii> G;

void solve(int Z, int T) {
	k = ri(), m = ri(), n = ri();
	F(i, 1, n) vis[i] = 0, d[i].clear(), g[i] = 0, mp[i].clear();
	F(i, 1, k) vis[ri()] = 1;
	G.clear();
	F(i, 1, m) {
		int u = ri(), v=  ri();
		G.pb({u, v});
		if(u != v) mp[u][v]++, mp[v][u]++;
		if(u != v)
			d[u].pb(v), d[v].pb(u);
		else g[u]++;
	}
//	if(T == 10000) {
//		if(Z == 5) {
//			cout<< k << ' ' << m << ' ' << n << '\n';
//			F(i, 1, n) if(vis[i]) cout << i << ' ';
//			cout << '\n';
//			for(pii v : G) cout <<v.fi << ' ' << v.se << '\n';
//		}
//		return;
//	}
	int ans = 0;
	F(i, 1, n) if(vis[i]) {
		for(int v : d[i]) if(vis[v]) ans++;
		ans += g[i];
	}
	assert(ans % 2 == 0);
	ans /= 2;
	Debug(ans);
	F(i, 1, n) if(!vis[i]) {
		for(int v : d[i]) if(vis[v]) g[i]++;
		Debug(i, g[i]);
	}
	int mx = 0, mx2 = 0;
	F(i, 1, n) if(!vis[i]) {
		if(g[i] > mx) mx2 = mx, mx = g[i];
		else mx2 = max(mx2, g[i]);
	}
	int res = mx + mx2;
	Debug(res);
	F(i, 1, n) if(!vis[i]) {
		for(int v : d[i]) if(!vis[v] && v != i) {
			Debug(i, v, g[i] + g[v], mp[i][v]);
			res = max(res, g[i] + g[v] + mp[i][v]);
		}
	}
	ans += res;
	cout<< ans << '\n';
}
bool Med;
signed main() {
	// Mry;
	int T = ri();
	F(z, 1, T) solve(z, T);
	// Try;
	return 0;
}

/*
1
11 7 20
3 5 7 8 10 12 14 15 16 19 20 
19 14
20 17
10 1
9 9
9 5
19 16
20 14

*/