#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> PII;
#define endl '\n'
const int N=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
int n,m,k;
//const int N = 2e5 + 10;
int h[N];
void solve()
{
    cin >> n >> m >> k;
    map<PII, int>nhh;
    unordered_map<int,int>nh;
    for(int i = 1; i <= k; i ++ ){
        h[i] = 0;
    }
    for(int i = 1; i <= n; i ++ ){
        int c;
        cin >> c;
        h[c] ++;
    }
    int ans = 0;
    for(int i = 1; i <= m; i ++ ){
        int a, b;
        cin >> a >> b;
        if(h[a] && h[b]){
            ans ++;
        }else if(h[a] && !h[b]){
            nh[b] ++;
        }else if(!h[a] && h[b]){
            nh[a] ++;
        }else{
            if(a > b) swap(a, b);
            nhh[{a, b}] ++;
        }
    }
    int nk = min(k - n, 2);
    if(nk == 0){
        cout << ans << endl;
    }else if(nk == 1){
        int mx = 0;
        for(auto i : nh){
            mx = max(mx, i.second + nhh[{i.first, i.first}]);
        }
        cout << ans + mx << endl;
    }else{
        vector<int> v;
        for(auto i : nh){
            v.push_back(i.second + nhh[{i.first, i.first}]);
        }
        int mx = 0;
        sort(v.begin(), v.end(), greater<int> ());
        if(v.size() >= 1) mx += v[0];
        if(v.size() >= 2) mx += v[1];
        for(auto i : nhh){
            if(i.first.first == i.first.second) continue;
            mx = max(mx,i.second + nh[i.first.first] + nh[i.first.second] + nhh[{i.first.second,i.first.second}] + nhh[{i.first.first, i.first.first}]);
        }
        cout << ans + mx << endl;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _=1;
    cin>>_;
    while(_--)
    {
        solve();    
    }    
    return 0;
}