/**
 *    title:  j.cpp
 *    author:  Proaes Meluam
 *    created:  2024-11-22 18:07:26
**/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "algo/debug.h" 
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
const double E = exp(1);
constexpr ll mod = 1e9 + 7;
// constexpr int inf = 0x3f3f3f3f;
constexpr ll inf = 0x3f3f3f3f3f3f3f3f;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tt = 1;
    cin >> tt;
    while (tt--) {
        int n, m, k;
        cin >> k >> m >> n;
        // debug(k, m, n);
        vector<vector<int>> adj(n + 1, vector<int>());
        map<int, int> f;
        vector<int> u(m + 1);
        vector<int> v(m + 1);
        for (int i = 1; i <= k; ++ i) {
            int x;
            cin >> x;
            f[x] = 1;
        }
        for (int i = 1; i <= m; ++ i) {
            cin >> u[i] >> v[i];
            adj[u[i]].emplace_back(v[i]);
            adj[v[i]].emplace_back(u[i]);
        }
        int ans = 0;
        for (int i = 1; i <= m; ++ i) {
            if (f.count(u[i]) && f.count(v[i])) {
                ans ++;
            }
        }
        int md = 0, cur = 0;
        for (int i = 1; i <= m; ++ i) {
            // map<int, int> mp;
            cur = 0;
            // debug(u[i], v[i]);
            if (!f.count(u[i])) {
                // debug("u");
                for (auto x : adj[u[i]]) {
                    if (f.count(x)) cur ++;
                }
            }
            if (!f.count(v[i])) {
                // debug("v");
                for (auto x : adj[v[i]]) {
                    if (f.count(x) || x == u[i]) cur ++;
                }
            }
            md = max(md, cur);
        }
        int cur2 = 0, curi = 0;
        for (int i = 1; i <= n; ++ i) {
            cur = 0;
            if (!f.count(i)) {
                for (auto x : adj[i]) {
                    if (f.count(x)) cur ++;
                }
            }
            if (cur > cur2) {
                cur2 = cur;
                curi = i;
            }
        }
        int cur3 = 0;
        for (int i = 1; i <= n; ++ i) {
            cur = 0;
            if (!f.count(i) && i != curi) {
                for (auto x : adj[i]) {
                    if (f.count(x) || x == curi) cur ++;
                }
            }
            cur3 = max(cur3, cur);
        }
        md = max(md, cur2 + cur3);
        ans += md;
        cout << ans << "\n";
    }
}