#include <bits/stdc++.h>
using namespace std;
#define _11037_ ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define endl '\n'
#define int long long
#define inf 4e18
#define MAX 400005
#define MOD 998244353
int T, n, m, k, f, a, b, ans, addval;
set<int> myfriends;
map<int, int> alone_val;
map<int, int> pair_val[MAX];
inline void init(void)
{
    ans = addval = 0;
    myfriends.clear(), alone_val.clear();
    for (int i = 1; i <= k; i++)
        pair_val[i].clear();
}
signed main()
{
    _11037_
    cin >> T;
    while (T--)
    {
        cin >> n >> m >> k, init();
        for (int i = 1; i <= n; i++)
            cin >> f, myfriends.insert(f);
        for (int i = 1; i <= m; i++)
        {
            cin >> a >> b;
            int finda = myfriends.count(a), findb = myfriends.count(b);
            if (finda && findb)
                ans++;
            else if (!finda && findb)
                alone_val[a]++;
            else if (finda && !findb)
                alone_val[b]++;
            else
            {
                if (a == b)
                    alone_val[a]++;
                else
                {
                    if (a > b)
                        swap(a, b);
                    pair_val[a][b]++;
                }
            }
        }
        int last = 0, now = 0;
        for (auto [u, val] : alone_val)
            if (val > now)
                last = now, now = val;
        addval += last + now;
        for (int i = 1; i <= k; i++)
            for (auto [u, val] : pair_val[i])
                addval = max(addval, val + alone_val[i] + alone_val[u]);
        cout << ans + addval << endl;
    }
}