#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define vi vector<int>
#define vll vector<long long>
#define double long double
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<'*'<<x<<'\n';
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define rep(x, y) for(int i=(x); i<=(y); i++)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int INF=0x3f3f3f3f;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
ll gcd(ll a,ll b)
{
	return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b)
{
	return a*b/gcd(a,b);
}
ll qmi(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}




void solve()
{
	map<int, bool>f;
	map<pii, int>mp;
	map<int, int>mpp;
	int n, m, k;
	cin >> n >> m >> k;
	rep(1, n)
	{
		int x;
		cin >> x;
		f[x] = 1;
	}
	int res = 0;
	rep(1, m)
	{
		int a, b;
		cin >> a >> b;
		if(f[a] && f[b])res ++;
		else
		{
			if(a != b)mp[{min(a, b), max(a, b)}]++;
			else mpp[a]++;
		}
	}
//	debug(res);
	priority_queue<pii>q;
	for(auto [tt, y]:mp)
	{
		int aa = tt.first, bb = tt.second;
		if(f[aa])mpp[bb] += y;
		if(f[bb])mpp[aa] += y;
	}
//	rep(1, k)cout << i << ":" << mpp[i] << endl;
	for(auto [x, y]:mpp)
	{
		q.push({y, x});
	}
	int t = 0, a = 0, b = 0;
	if(q.size())t += q.top().first, a = q.top().second, q.pop();
	if(q.size())t += q.top().first, b = q.top().second, q.pop();
	t += mp[{min(a, b), max(a, b)}];
	for(auto [tt, y]:mp)
	{
		int aa = tt.first, bb = tt.second;
		if(f[aa] || f[bb])continue;
		int u = mpp[aa] + mpp[bb] + y;
		t = max(t, u);
	}
	cout << res + t << endl;
}



signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int _;
	_=1;
	cin>>_;
	while(_--)solve();
	return 0;
}