#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const ll maxn = 2e5 + 10;
bool fri[maxn];
ll cnt[maxn];
bool cmp(ll a, ll b) {
    return a > b;
}

struct edge {
    ll u, v;
    bool operator<(const edge& b)const {
        return u < b.u;
    }
};

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll t;
    cin >> t;
    while (t--) {
        ll n, m, k;
        cin >> n >> m >> k;
        map<edge, ll> mp;
        for (ll i = 1; i <= k; i++) {
            cnt[i] = 0;
            fri[i] = false;
        }
        for (ll i = 1; i <= n; i++) {
            ll temp;
            cin >> temp;
            fri[temp] = true;
        }

        ll ans = 0;
        for (ll i = 1; i <= m; i++) {
            ll x, y;
            cin >> x >> y;
            if (fri[x] && fri[y]) {
                ans++;
            }
            else if ((!fri[x]) && fri[y]) {
                cnt[x]++;
            }
            else if (fri[x] && (!fri[y])) {
                cnt[y]++;
            }
            else {
                if (x > y) swap(x, y);
                mp[{x, y}]++;
            }
        }
        ll mx = 0;
        // for (auto it : vp) {
        //     ll x = it.first, y = it.second;
        //     if (mp.find({ x,y }) != mp.end()) {
        //         mp[{x, y}]++;
        //     }
        //     else {
        //         mp[{x, y}] = cnt[x] + cnt[y];
        //     }
        // }
        for (auto it : mp) {
            mx = max(mx, it.second + cnt[it.first.u] + cnt[it.first.v]);
        }
        sort(cnt + 1, cnt + 1 + k, cmp);
        ans += max(mx, cnt[1] + cnt[2]);
        cout << ans << endl;
    }


    return 0;
}