#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int bac[N], id[N];
bool vis[N];
bool cmp(int a, int b) {
    return bac[a] > bac[b];
}
void solve() {
    int n, m, k, u, v, x;
    cin >> k >> m >> n;
    for (int i = 1; i <= n; ++i) {
        id[i] = i;
        bac[i] = vis[i] = 0;
    }
    for (int i = 1; i <= k; ++i) {
        cin >> x;
        vis[x] = 1;
    }
    int ans = 0;
    map <pair<int, int>, int> mp;
    for (int i = 1; i <= m; ++i) {
        cin >> u >> v;
        if (u > v) swap(u, v);
        if (vis[u] && vis[v]) {
            ans++;
            continue;
        }
        if (!vis[u] && !vis[v] && u != v) {
            mp[{u, v}]++;
            continue;
        }
        if (vis[u]) bac[v]++;
        else bac[u]++;
    }
    sort(id + 1, id + 1 + n, cmp);
    int mx = bac[id[1]] + bac[id[2]];
    // for (int i = 1; i <= n; ++i) cout << bac[i] << " ";
    // cout << endl;
    // for (int i = 1; i <= n; ++i) cout << id[i] << " ";
    // cout << endl;
    for (auto it : mp) {
        int u = it.first.first, v = it.first.second;
        mx = max(mx, bac[u] + bac[v] + it.second);
    }
    // cout << ans << " ! " << mx << endl;
    cout << ans + mx << endl;
}
int main() {
    cin.tie(nullptr) -> ios::sync_with_stdio(false);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
}