// Ice cream? I scream! 
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
	#define freopen Chitanda
#endif
#define wjy namespace
#define xsy std
typedef long long ll;
using wjy xsy;

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

const int MAXN = 1e6 + 5;

int f[MAXN], u[MAXN], v[MAXN];
bool vis[MAXN];

struct node
{
	int id, cnt, cnt1;
	bool operator < (const node &x) const
	{
		if (cnt == x.cnt && cnt1 == x.cnt1)
			return id < x.id;
		if (cnt == x.cnt)
			return cnt1 < x.cnt1;
		return cnt < x.cnt;
	}
}p[MAXN];

int main()
{
	int T;
	scanf("%d", &T);
	while (T--)
	{
		int n, m, k;
		scanf("%d%d%d", &n, &m, &k);
		memset(vis, false, sizeof(bool) * (k + 2));
		// memset(cnt, 0, sizeof(int) * (k + 2));
		for (int i = 1; i <= k; i++)
			p[i] = {i, 0, 0};
		for (int i = 1; i <= n; i++)
			scanf("%d", f + i), vis[f[i]] = true;
		int ans = 0;
		for (int i = 1; i <= m; i++)
		{
			scanf("%d%d", u + i, v + i);
			if (vis[v[i]] && !vis[u[i]])
				p[u[i]].cnt++;
			else if (vis[u[i]] && !vis[v[i]])
				p[v[i]].cnt++;
			else if (!vis[u[i]] && !vis[v[i]])
				p[u[i]].cnt1++, p[v[i]].cnt1++;
		}
		sort(p + 1, p + k + 1);
		// bool t1 = vis
		vis[p[k].id] = vis[p[k - 1].id] = true;
		for (int i = 1; i <= m; i++)
			if (vis[u[i]] && vis[v[i]])
				ans++;
		vis[p[k].id] = vis[p[k - 1].id] = false;
		bool f2 = vis[p[k - 2].id];
		vis[p[k].id] = vis[p[k - 2].id] = true;
		int res = 0;
		for (int i = 1; i <= m; i++)
			if (vis[u[i]] && vis[v[i]])
				res++;
		ans = max(ans, res);
		vis[p[k].id] = false;
		vis[p[k - 2].id] = f2;
		vis[p[k - 1].id] = vis[p[k - 2].id] = true;
		res = 0;
		for (int i = 1; i <= m; i++)
			if (vis[u[i]] && vis[v[i]])
				res++;
		printf("%d\n", max(ans, res));
	}
	return 0;
}