#include<bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define ll long long
using namespace std;
const int maxn = 3e5 + 10;
int tag[maxn], de[maxn];
vector<int> G[maxn];
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    // cout << n << " " << m << " " << k << "\n";
    for (int i = 1; i <= k; i++)
        tag[i] = de[i] = 0, G[i].clear();
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        tag[x] = 1;
    }
    int ans = 0, sum = 0;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        if (tag[u] && tag[v]) {
            ans++;
        } else if (tag[u]) {
            de[v]++;
        } else if (tag[v])
            de[u]++;
        else {
            G[u].push_back(v);
            G[v].push_back(u);
        }
    }
    for (int i = 1; i <= k; i++) {
        if (!tag[i]) {
            int temsum = 0, mx = 0;
            map<int, int> mp;
            for (auto v : G[i]) {
                mp[v]++;
            }
            for (auto [u, v] : mp)
                mx = max(mx, v + de[u]);
            temsum += mx + de[i];
            sum = max(sum, temsum);
        }
    }
    sort(de + 1, de + 1 + k);
    sum = max(sum, de[k] + de[k - 1]);
    cout << ans + sum << "\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}