#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int N = 2e5 + 10;
int cnt1[N];
map<int, int> cnt2[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int tc;
    cin >> tc;
    while (tc--) {
        int n, k, m, ans = 0;
        cin >> k >> m >> n;
        for (int i = 1; i <= n; i++) cnt1[i] = 0, cnt2[i].clear();
        map<int, bool> mp;
        for (int i = 1; i <= k; i++) {
            int x;
            cin >> x;
            mp[x] = true;
        }
        for (int i = 1; i <= m; i++) {
            int u, v;
            cin >> u >> v;
            if (mp.count(u) && mp.count(v))
                ans++;
            else if (mp.count(u) && (mp.count(v) == 0))
                cnt1[v]++;
            else if (mp.count(v) && (mp.count(u) == 0))
                cnt1[u]++;
            else if (mp.count(u) == 0 && u == v)
                cnt1[u]++;
            else if (u != v && mp.count(u) == 0 && mp.count(v) == 0)
                cnt2[u][v]++, cnt2[v][u]++;
        }
        int mx1 = 0, mx2 = 0, p1 = -1, p2 = -1;
        for (int i = 1; i <= n; i++)
            if (mp.count(i) == 0 && cnt1[i] > 0) {
                if (mx1 <= cnt1[i])
                    mx2 = mx1, p2 = p1, mx1 = cnt1[i], p1 = i;
                else if (mx2 <= cnt1[i])
                    mx2 = cnt1[i], p2 = i;
            }
        int nw_ans = mx1 + mx2;
        nw_ans += ((p1 != -1 && p2 != -1) ? cnt2[p1][p2] : 0);
        for (int i = 1; i <= n; i++)
            if (!cnt2[i].empty()) {
                auto it = cnt2[i].end();
                it--;
                int nw = 0;
                if ((*it).first == i) {
                    nw += (*it).second;
                    if (it != cnt2[i].begin()) it--;
                }
                nw += (*it).second;
                nw += cnt1[i] + cnt1[(*it).first];
                nw_ans = max(nw_ans, nw);
            }
        cout << nw_ans + ans << "\n";
    }
    return 0;
}