#include<bits/stdc++.h>

using namespace std;

const int N = 200010;
typedef long long ll;
 
int n,m,k;
 

void solve()
{
    cin >> n >> m >> k;
	//cout <<'*'<<endl;

	set<int>fd;

	for(int i = 1;i <= n;i++)
	{
		int f;
		cin >> f;
		fd.insert(f);
	}	
    
	map<int,int>ad;
	map<pair<int,int>,int>ins;

	for(int i = 1;i <= k;i++)ad[i] = 0;

	int s = 0;

	for(int i = 1;i <= m;i++)
	{
		int a,b;
		cin >> a >> b;

		if(a == b)
		{
            if(fd.find(a) == fd.end())ad[a]++;
			else s++;

			continue;
		}

		if(fd.find(a) != fd.end() && fd.find(b) != fd.end())
		{
			s++;
			continue;
		}
		else if(fd.find(a) == fd.end() && fd.find(b) != fd.end())
		{
            ad[a]++;
		}
		else if(fd.find(b) == fd.end() && fd.find(a) != fd.end() )
		{
            ad[b]++;
		}
		else
		{
            if(a > b)
			{
				swap(a,b);
			}
			ins[{a,b}]++;
		}
		//cout << a <<' '<< b <<endl;
	}

	int mx = 0;

	for(auto i : ins)
	{
        mx = max(mx,i.second + ad[i.first.first] + ad[i.first.second]);
	}

	vector<int>q;
    
	for(auto i : ad)
	{
        q.push_back(i.second);
	}

	sort(q.begin(),q.end(),greater<>());

	mx = max(mx,q[0] + q[1]);
	

	cout << mx + s <<endl;
	 

	 
}



 


int main()
{ 
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t =1;
	cin >> t;

	while(t--)solve();	
	return 0;
}