#include <bits/stdc++.h>
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define N 210000
using namespace std;
typedef long long ll;

int v[N], a[N], n, m, k, ans, mx;
int l[N], r[N];
void work() {
    cin>>n>>m>>k;
    ans = 0; mx = 0;
    for(int i = 1;i <= k; i++)
        v[i] = a[i] = 0;
    map<pair<int, int>, int> p;
    for(int i = 1;i <= n; i++) {
        int x; cin>>x;
        v[x] = 1;
    }
    for(int i = 1; i <= m; i++) {
        cin>>l[i]>>r[i];
        if(v[l[i]] && v[r[i]]) ans++;
        else if(v[l[i]]) {
             ++a[r[i]];
        }
        else if(v[r[i]]) {
            ++a[l[i]];
        }
        else if(l[i] == r[i]) ++a[l[i]];
        else {
            if(l[i] > r[i]) swap(l[i], r[i]);
            ++p[{l[i], r[i]}];
        }
    }
    for(int i = 1; i <= m; i++) {
        if(v[l[i]] == 0 && v[r[i]] == 0) {
            mx = max(mx, p[{l[i], r[i]}] + a[l[i]] + a[r[i]]);
        }
    }
    sort(a + 1, a + k + 1);
    mx = max(mx, a[k] + a[k - 1]);


    cout<<ans + mx<<"\n";
}

signed main() {
    io;
    int t = 1;
    cin >> t;
    while (t--) {
        work();
    }
    return 0;
}