#include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
#include<string>
#include<math.h>
#include<map>
#include<set>
#include<string.h>
#include<iomanip>
#include<queue>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
int mod = 998244353;
const int N = 1e5 + 5;
vector<vector<int> > q(200005);
vector<vector<int> > p(200005);
int f[200005]{};
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, m, k;
		cin >> n >> m >> k;
		int ans = 0;

		for (int i = 1; i <= k; i++)
		{
			f[i] = 0;
			q[i].clear();
			p[i].clear();
		}
		for (int i = 1; i <= n; i++)
		{
			int ff;
			cin >> ff;
			f[ff] = 1;
		}
		for (int i = 1; i <= m; i++)
		{
			int a, b;
			cin >> a >> b;
			if (f[a] == 1 && f[b] == 1) ans++;
			else
			{
				q[a].push_back(b);
				p[b].push_back(a);
			}
		}
		int maxx = 0;
		for (int i = 1; i <= k; i++)
		{
			for (int j = i; j <= k; j++)
			{
				if (f[i] != 1 && f[j] != 1)
				{
					int num = 0;
					for (auto u : q[i])
					{
						if (u == i || u == j||f[u]==1)
						{
							num++;
						}
					}		
					for (auto v : p[i])
					{
						if ( v == j||f[v]==1)
						{
							num++;
						}
					}
					if(i!=j) 
					{
						for (auto u : q[j])
						{
							if ( u == j || f[u] == 1)
							{
								num++;
							}
						}
						for (auto v : p[j])
						{
							if ( f[v] == 1)
							{
								num++;
							}
						}
					}

					maxx = max(num, maxx);
				}
			}
		}
		cout << maxx + ans << endl;
	}
}
//5
//4 12 7
//5 7 3 6
//3 6
//2 2
//1 4
//2 4
//1 3
//7 6
//4 1
//5 4
//1 1
//1 1
//2 1
//3 7
//2 7 6
//2 4
//1 2
//3 2
//2 5
//5 4
//2 6
//4 6
//2 6
//1 1 2
//1
//1 2
//2 1 2
//1 2
//1 2
//2 1 100
//24 11
//11 24