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

#define ios ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define ull unsigned long long
#define endl '\n'
typedef long long ll;
typedef pair<int, int> PII;
const int N = 310, M = 5e3 + 10, INF = 1e18, mod = 1e9 + 7;
// const int P1 = 6907, P2 = 13331, mod1 = 998244353, mod2 = 1e9+9;

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<bool> st(k + 1);
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        st[x] = 1;
    }
    vector<map<int, bool>> g(k + 1);
    vector<int> din(k + 1);
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
        g[u][v] = 1, g[v][u] = 1;
        din[u]++, din[v]++;
    }

    int ans = m, now = k;
    set<PII> se;
    set<int> have;
    for (int i = 1; i <= k; i++)
    {
        if(st[i])
            continue;
        se.insert({din[i], i});
        have.insert(i);
    }

    while (now > n + 2)
    {
        now--;
        auto t = se.begin();
        int u = (*t).second;
        se.erase(t);
        have.erase((*t).second);
        for(auto [x,y]:g[u])
        {
            // if(!have.count(x))
            //     continue;
            se.erase({din[x],x});
            din[x]--;
            ans--;
            if(din[x]>=0)
                se.insert({din[x], x});
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios;
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}