#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
const int MAX = 3e5 + 5;

void solve(){
    int n, m, k; cin >> n >> m >> k;
    vector<int> a(n);
    set<int> vis;
    for (int x : a){
        cin >> x;
        vis.insert(x - 1);
    }
    int ans = 0, sum = 0;
    vector<array<int, 2>> b(m);
    vector<int> cnt(k);
    map<array<int, 2>, int> mp;
    for (auto &[x, y] : b){
        cin >> x >> y;
        x --, y --;
        if (x > y) swap(x, y);
        if (vis.count(x) and vis.count(y)){
            sum ++;
        }
        else if (vis.count(x)){
            cnt[y] ++;
        }
        else if (vis.count(y)){
            cnt[x] ++;
        }
        else if (x == y){
            cnt[x] ++;
        }
        else{
            mp[{x, y}] ++;
        }
    }
    // for (int i = 0; i < k; i++){
    //     cerr << cnt[i] << ' ';
    // }
    // cerr << sum;
    for (auto [x, y] : b){
        ans = max(ans, cnt[x] + cnt[y] + mp[{x, y}]);
    }
    if (k >= 2){
        sort(cnt.begin(), cnt.end(), greater<int>());
        ans = max(ans, cnt[0] + cnt[1]);
    }
    cout << ans + sum << endl;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    // cout << fixed << setprecision(10);
    int T;cin>>T;while (T--)
        solve();
}