#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl
const int N=2e5+10;

map<ll, ll>mp[N];
bool vis[N];
ll g[N];

void solve()
{
    ll n, k, m, ans = 0, s = 0;
    cin >> n >> m >> k;
    rep(i, 1, k)
    {
        mp[i].clear();
        vis[i] = 0;
        g[i] = 0;
    }
    rep(i, 1, n)
    {
        ll x;
        cin >> x;
        vis[x] = 1;
    }
    rep(i, 1, m)
    {
        ll u, v;
        cin >> u >> v;
        if(vis[u] && vis[v])
        {
            s++;
        }
        else if(vis[u])
        {
            g[v]++;
        }
        else if(vis[v])
        {
            g[u]++;
        }
        else if(u == v)
        {
            g[u]++;
        }
        else
        {
            mp[u][v]++;
            mp[v][u]++;
        }
    }
    ans = s;
    rep(i, 1, k)
    {
        ll res = g[i] + s;
        for(auto [x, y] : mp[i])
        {
            ans = max(ans, res + y + g[x]);
        }
    }
    sort(g + 1, g + k + 1);
    if(k != 1) ans = max(ans, g[k] + g[k - 1]);
    else ans = max(ans, g[k]);
    cout << ans << endl;
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
// #ifndef  ONLINEJUDGE
//     freopen("test.in","r",stdin);
//     freopen("test.out","w",stdout);
// #endif
    int T;
    cin>>T;
    while(T--)
    {
        solve();
    }

    return 0;
}