#include <bits/stdc++.h>
#define int long long
using i64 = unsigned long long;
using namespace std;
int d[4][2] = {{1, 0}, {0, 1}, {0, -1}, {-1, 0}};
string str;
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> vis(k, 0), in(k, 0);
    set<pair<int, int>> v;
    for (int i = 0; i < n; ++i)
    {
        int x;
        cin >> x;
        x--;
        vis[x] = 1;
    }
    map<pair<int, int>, int> mp;
    int now = 0;
    int nw = 0;
    int mx1 = 0, mx2 = 0;
    for (int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        if (a > b)
            swap(a, b);
        if (vis[a] && vis[b])
        {
            now++;
        }
        else if (vis[a] || vis[b])
        {
            if (!vis[a])
            {
                in[a]++;
            }
            else
                in[b]++;
        }
        else if (a == b)
        {
            in[a]++;
        }
        else
        {
            mp[{a, b}]++;
            v.insert({a, b});
        }
    }

    for (auto [a, b] : v)
    {
        nw = max(nw, mp[{a, b}] + in[a] + in[b]);
    }
    sort(in.begin(), in.end());
    nw = max(nw, in[k - 1] + in[k - 2]);
    cout << nw + now << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}