#include<bits/stdc++.h>
#define fi first
#define se second
#define MULT_TEST 1
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
inline void Solve() {
    int n, m, k, tot = 0, ans = 0;
    n = read(), m = read(), k = read();
    vector<int> sum(k + 1), vis(k + 1);
    vector<pair<int, int>> E;
    map<pair<int, int>, int> mp;
    for (int f, i = 1; i <= n; i++) vis[f = read()] = 1;
    for (int i = 1; i <= m; i++) {
        int u = read(), v = read();
        if (vis[u] && vis[v]) tot++;
        else if (!vis[u] && !vis[v]) {
            E.push_back({u, v});
            mp[{u, v}]++, mp[{v, u}]++;
        }
        else if (vis[u] && !vis[v]) sum[v]++;
        else sum[u]++;
    }
    for (auto [u, v] : E) 
        ans = max(ans, sum[u] + sum[v] + mp[{u, v}]);
    for (int mx = 0, i = 1; i <= k; i++) {
        ans = max(ans, sum[i] + mx);
        mx = max(mx, sum[i]);
    }
    printf("%d\n", ans + tot);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}