#include<bits/stdc++.h>
typedef long long ll;
const int maxn = 2e5 + 100;
int f[maxn];
using pii = std::pair<int,int>;
pii arr[maxn];
void solve(){
    int n,m,k;
    std::cin >> n >> m >> k;
    std::fill(f + 1,f + 1 + k,0);
    for(int i = 0;i < n;i++){
        int op;
        std::cin >> op;
        f[op] = 1;
    }
    std::map<pii,int>mp;
    std::map<int,int>cnt;
    int ans = 0;
    for(int i = 1;i <= m;i++){
        std::cin >> arr[i].first >> arr[i].second;
        if(arr[i].first > arr[i].second)std::swap(arr[i].first,arr[i].second);
        if(arr[i].first == arr[i].second){
            if(f[arr[i].first])ans++;
            else cnt[arr[i].first]++;
        }
        if(f[arr[i].first]){
            if(f[arr[i].second]){
                ans++;
            }
            else{
                cnt[arr[i].second]++;
            }
        }
        else{
            if(f[arr[i].second]){
                cnt[arr[i].first]++;
            }
            else{
                mp[arr[i]]++;
            }
        }
    }
    int mx = 0,mix = 0;
    for(auto [x,w] : cnt){
        if(w >= mx){
            mix = mx;
            mx = w;
        }
        else if(w > mix){
            mix = w;
        }
    }
    // std::cout << ans << " " << mx << " " << mix << "\n";
    int res = ans + mx + mix;
    for(int i = 1;i <= m;i++){
        if(f[arr[i].first] == 0 and 
        f[arr[i].second] == 0
        and arr[i].first != arr[i].second){
            res = std::max(res,ans + cnt[arr[i].first] + cnt[arr[i].second] + mp[arr[i]]);
            // if(res == 11){
            //     std::cout << arr[i].first << " " << arr[i].second << "\n";
            // }
        }
    }
    std::cout << res << "\n";
}
int main(){
    std::ios::sync_with_stdio(0);
    std::cin.tie(0),std::cout.tie(0);
    int t;
    std::cin >> t;
    while(t--){
        solve();
    }
    return 0;
}