#include<bits/stdc++.h>
using namespace std;

int T;
int n,m,k;
int f[200005];

pair<int,int> e[200005];
map<pair<int,int>, int> mp;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> T;
    while(T--){
        cin >> n >> m >> k;
        for(int i=1;i<=k;i++) f[i] = 0;
        set<int> st;
        mp.clear();
        for(int i=1;i<=n;i++){
            int x; cin >> x;
            st.insert(x);
        }

        int cnt = 0;
        for(int i=1;i<=m;i++){
            int x,y;
            cin >> x >> y;
            if(x > y) swap(x,y);
            e[i] = {x,y};
            mp[{x,y}] ++;
            bool b1 = st.count(x), b2 = st.count(y);
            if(b1 && b2){
                cnt ++;
                continue;
            }
            else if(b1 && !b2){
                f[y] ++;
            }
            else if(!b1 && b2){
                f[x] ++;
            }
            else{
                if(x == y) f[x] ++;
            }
        }

        int ans = 0;
        int fst = 0, snd = 0;
        sort(e+1, e+1+m);
        m = unique(e+1, e+1+m) - e - 1;
        // cout << m << endl;
        vector<int> v;
        for(int i=1;i<=m;i++){
            int x = e[i].first, y = e[i].second;
            bool b1 = st.count(x), b2 = st.count(y);
            if(b1 && b2) continue;
            else if(b1){
                v.push_back(y);
            }
            else if(b2){
                v.push_back(x);
            }
            else{
                if(x == y){
                    ans = max(ans, f[x]);
                }
                else{
                    ans = max(ans, f[x] + f[y] + mp[e[i]]);
                }
            }
            // cout << x << " " << y << " " << fst << " " << snd << endl;
        }
        sort(v.begin(), v.end());
        v.erase(unique(v.begin(), v.end()), v.end());
        for(int x: v){
            if(f[x] > fst){
                snd = fst;
                fst = f[x];
            }
            else if(f[x] > snd){
                snd = f[x];
            }
        }
        // cout << fst << " " << snd << endl;
        ans = max(ans, fst + snd);

        cout << ans + cnt << endl;
    }
}