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

typedef long long ll;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int T;
	cin >> T;
	while(T -- ) {
		int n, m, k;
		cin >> n >> m >> k;
		
		vector<int> p(k + 1);
		for(int i = 1; i <= k; i ++ ) p[i] = i;
		
		auto find = [&](auto &&find, int x) -> int {
			if(p[x] != x) p[x] = find(find, p[x]);
			return p[x];
		};
		
		int now = -1;
		for(int i = 0; i < n; i ++ ) {
			int x;
			cin >> x;
			if(now == -1) now = x;
			else {
				int pnow = find(find, now), px = find(find, x);
				if(pnow != px) p[px] = pnow;
			}
		}
		
		// cout << "!!!  " << now << ' ' << find(find, now) << '\n';
		
		vector<int> f(k + 1, 0);
		map<pair<int, int>, int> mp;
		for(int i = 0; i < m; i ++ ) {
			int u, v;
			cin >> u >> v;
			int pu = find(find, u), pv = find(find, v);
			if(pu == pv) {
				f[pu] ++ ;
			} else {
				mp[{pu, pv}] ++ ;
				mp[{pv, pu}] ++ ;
			}
		}
		
		int ans = 0, val1 = 0, val2 = 0, id1 = -1, id2 = -1;
		for(int i = 0; i < k; i ++ ) ans = max(ans, f[i]);
		for(auto [_, cnt] : mp) {
			auto [u, v] = _;
			int pnow = find(find, now);
			int pu = find(find, u), pv = find(find, v);
			
			if(pu != pnow && pv != pnow) {
				int res = f[pu] + f[pv] + f[pnow] + mp[{pu, pv}] + mp[{pu, pnow}] + mp[{pv, pnow}];
				ans = max(ans, res);
			} else {
				if(pu != pnow && pu != id1 && pu != id2) {
					int res = f[pu] + mp[{pu, pnow}];
					if(res > val1) {
						val2 = val1, id2 = id1;
						val1 = res, id1 = pu;
					} else if(res > val2) {
						val2 = res, id2 = pu;
					}
				} else if (pv != pnow && pv != id1 && pv != id2) {
					int res = f[pv] + mp[{pv, pnow}];
					if(res > val1) {
						val2 = val1, id2 = id1;
						val1 = res, id1 = pv;
					} else if(res > val2) {
						val2 = res, id2 = pv;
					}
				}
			}
		}
		ans = max(ans, f[find(find, now)] + val1 + val2);
		cout << ans << '\n';
	}
	return 0;
}