#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 mod = 998244353;
#define endl '\n'

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<bool> vis(k + 1, 0);
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        vis[x] = 1;
    }
    vector<vector<int>> g(k + 1);
    vector<vector<int>> g2(k + 1);
    vector<int> selfcnt(k + 1, 0);
    vector<array<int, 2>> edges;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
        edges.push_back({u, v});
        if (vis[u] && vis[v]) // 已有好友关系
        {
            ans++;
        }
        else
        {
            if (u == v)
            {
                selfcnt[u]++;
                continue;
            }
            if (vis[u])
            {
                g[v].push_back(u);
            }
            else if (vis[v])
            {
                g[u].push_back(v);
            }
            else
            {
                g2[u].push_back(v);
            }
        }
    }
    int finalans = ans;
    vector<int> st;
    for (int i = 1; i <= k; i++)
    {
        finalans = max(finalans, ans + int(g[i].size()) + selfcnt[i]);
        st.push_back(g[i].size() + selfcnt[i]);
    }
    sort(st.rbegin(), st.rend());
    finalans = max(finalans, ans + st[0] + st[1]);
    map<array<int, 2>, int> mp;
    for (auto a : edges)
    {
        if (a[0] != a[1] && !(vis[a[0]] || vis[a[1]]))
        {
            if (a[0] > a[1])
                swap(a[0], a[1]);
            if (!mp.count(a))
                mp[a] = g[a[0]].size() + g[a[1]].size() + selfcnt[a[0]] + selfcnt[a[1]];
            mp[a]++;
        }
    }
    for (auto a : mp)
    {
        finalans = max(finalans, ans + a.second);
    }
    cout << finalans << endl;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}