#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

#define int ll
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> f(k + 1);
    fr(i, 1, n)
    {
        int x;
        cin >> x;
        f[x] = 1;
    }
    int base = 0;
    map<pii, int> mp;
    vector<int> d(k + 1);
    fr(i, 1, m)
    {
        int x, y;
        cin >> x >> y;
        if (x > y)
            swap(x, y);
        if (f[x] && f[y])
        {
            base++;
        }
        else if (!f[x] && !f[y])
        {
            mp[{x, y}]++;
        }
        else if (f[x])
        {
            d[y]++;
        }
        else
            d[x]++;
    }
    int ans = 0;
    pll res = {0, 0};
    for (auto [i, j] : mp)
    {
        auto [u, v] = i;
        ans = max(ans, v + d[u] + d[v]);
    }
    fr(i, 1, k)
    {
        if (!f[i])
        {
            if (d[i] > res.first)
            {
                res = {d[i], res.first};
            }
            else if (d[i] > res.second)
            {
                res.second = d[i];
            }
        }
    }
    ans = max(res.first + res.second, ans);
    cout << ans + base << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}