#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> PII;
#define endl '\n'
const int N=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
ll f[N];
vector<ll> e[N];
vector<ll> x[N];
vector<ll> g[N];
void solve()
{
	ll n,m,k;
	cin>>n>>m>>k;
	map<ll,ll> mp;
	for(int i=1;i<=n;i++) 
	{
		cin>>f[i];
		mp[f[i]]++;
	}
	ll ans=0,mx=0;
	for(int i=1;i<=m;i++) 
	{
		ll u,v;
		cin>>u>>v;
		if(mp.count(u)&&mp.count(v)) ans++;
		else if(mp.count(u)) e[v].push_back(u);
		else if(mp.count(v)) x[v].push_back(u);
		else if(!mp.count(u)&&!mp.count(v))
		{
			g[v].push_back(u);
			mx=max(mx,(ll)g[v].size()+(ll)g[u].size());
		}
	}
	vector<PII> v;
	for(int i=1;i<=k;i++)
	{
		v.push_back({e[i].size(),i});
	}
	sort(v.begin(),v.end(),greater<PII>());
	ll id1=v[0].second,id2=v[1].second;
	ll sum1=0,sum2=0;
	for(int i=1;i<=n;i++)
	{
		for(auto j:x[f[i]])
		{
			if(j==id1) sum1++;
			if(j==id2) sum1++;
		}
	}
	for(auto j:g[id1])
	{
		if(j==id2) sum2++;
	}
	for(auto j:g[id2])
	{
		if(j==id1) sum2++;
	}
	ll sum=sum1+sum2;
	cout<<max(ans+sum+v[0].first+v[1].first,ans+sum1+mx)<<endl;
	for(int i=1;i<=k;i++) e[i].clear(),g[i].clear(),x[i].clear();
	return;	
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int _=1;
	cin>>_;
	while(_--)
	{
		solve();	
	}	
	return 0;
}