#include <bits/extc++.h>

using ll = long long;

using pll = std::pair<ll, ll>;
using pii = std::pair<int, int>;

template <class T>
bool chmax(T& x, const T& v) {
  if (x < v) {
    x = v;
    return true;
  } else {
    return false;
  }
}

void solve() {
  int N, M, K;
  std::cin >> N >> M >> K;
  std::set<int> friends;
  for (int i = 0; i < N; i++) {
    int f;
    std::cin >> f;
    f--;
    friends.insert(f);
  }

  std::map<pii, int> two;
  std::vector<int> one(K);

  int fans = 0;

  for (int i = 0; i < M; i++) {
    int a, b;
    std::cin >> a >> b;
    a--, b--;

    if (a > b) std::swap(a, b);

    bool ainf = friends.contains(a), binf = friends.contains(b);

    if (ainf && binf) {
      fans++;
    } else if (ainf && !binf) {
      one[b]++;
    } else if (!ainf && binf) {
      one[a]++;
    } else if (a == b) {
      one[a]++;
    } else {
      two[{a, b}]++;
    }
  }

  if (K == 1) {
    std::cout << 0 << std::endl;
    return;
  }

  int nans = 0;

  std::vector tmp = one;

  std::ranges::sort(tmp, std::greater<>());

  nans = tmp[0] + tmp[1];

  for (auto& [p, c] : two) {
    auto [a, b] = p;
    chmax(nans, c + one[a] + one[b]);
  }

  std::cout << fans + nans << std::endl;
}

int main() {
  int T;
  std::cin >> T;
  while (T--) {
    solve();
  }
}