#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],nh[N];
void solve()
{
    cin >> n >> m >> k;
    map<PII, int>nhh;
    for(int i = 1; i <= k; i ++ ){
        h[i] = nh[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);
    int mx = 0;
    for(int i = 1; i <= k; i ++ ){
        for(int j = i + 1; j <= k; j ++ ){
            mx = max(mx, nh[i] + nh[j] + nhh[{i, j}] + nhh[{i, i}] + nhh[{j, j}]);
        }
    }
    cout << ans + mx << endl;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _=1;
    cin>>_;
    while(_--)
    {
        solve();    
    }    
    return 0;
}