#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
const int N = 1e5 + 5;
void solve() {
    int n, k, m, ans = 0, res = 0;
    cin >> n >> k >> m;
    vector<int> a(n), v(N), c(m + 1);
    vector<int> p1(k), p2(k);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        v[a[i]] = 1;
    }
    map<pair<int, int>, int> mp;
    for (int i = 0; i < k; i++) {
        cin >> p1[i] >> p2[i];
        if (p1[i] > p2[i]) swap(p1[i], p2[i]);
        if (v[p1[i]] && v[p2[i]]) {
            ans++;
        } else if (v[p1[i]]) {
            c[p2[i]]++;
        } else if (v[p2[i]]) {
            c[p1[i]]++;
        } else {
            if (p2[i] == p1[i]) {
                c[p2[i]]++;
            } else {
                mp[{p1[i], p2[i]}]++;
            }
        }
        
    }
    for (int i = 0; i < k; i++) {
        if (p1[i] != p2[i]) res = max(res, c[p1[i]] + c[p2[i]] + mp[{p1[i], p2[i]}]);
        else res = max(res, p1[i]);
    }
    sort(c.begin(), c.end(), greater<>());
    int tmp = 0;
    for (int i = 0; i < min(2, (int)c.size()); i++) tmp += c[i];
    res = max(tmp, res);
    cout << ans + res << '\n';
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}