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

using namespace std;

void solve () {
    int n, m, k;
    cin >> n >> m >> k;

    vector <bool> f (k + 1);
    for (int i = 1; i <= n; i ++) {
        int x;
        cin >> x;

        f[x] = true;
    }

    int sum = 0;
    vector <map <int, int>> mp (k + 1);
    vector <int> a (k + 1);
    for (int i = 0; i < m; i ++) {
        int x, y;
        cin >> x >> y;

        if (f[x] && f[y]) {
            sum ++;
            continue;
        }
        if (! f[x] && ! f[y]) {
            mp[x][y] ++;
            mp[y][x] ++;
            continue;
        }
        if (! f[x]) {
            swap (x, y);
        }
        a[y] ++;
    }   

    vector <int> p (k + 1);
    iota (p.begin (), p.end (), 0);
    sort (p.begin () + 1, p.end (), 
        [&](const int &x, const int &y) {
            return a[x] > a[y];
        }
    );

    if (n >= k - 2) {
        cout << m << '\n';
        return;
    }

    int ans = sum;
    for (int i = 1; i <= k; i ++) {
        if (f[i]) {
            continue;
        }
        int tot = a[i] + (p[1] == i ? a[p[2]] : a[p[1]]);
        for (auto [x, y] : mp[i]) {
            tot = max (tot, a[i] + y + a[x]);
        }
        ans = max (ans, sum + tot);
    }

    cout << ans << '\n';
}

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

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}