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

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n, k;
    cin >> n >> k;
    vector<vector<int>> a(k);
    for (auto &ai : a) {
      int l;
      cin >> l;
      ai.resize(l);
      for (int &aij : ai) {
        cin >> aij;
        --aij;
      }
    }

    auto solve = [&] {
      int r = 0;
      vector<vector<int>> g(k + n);
      for (int i = 0; i < k; ++i) {
        for (auto j : a[i]) {
          g[i].push_back(j + k);
          g[j + k].push_back(i);
        }
      }
      static constexpr int INF = 1 << 30;
      for (int i = 0; i < n; ++i) {
        vector<int> d(n + k, INF);
        queue<int> bfs;
        bfs.push(i + k);
        d[i + k] = 0;
        while (not bfs.empty()) {
          int u = bfs.front();
          bfs.pop();
          if (u >= k) {
            r = max(r, d[u]);
          }
          for (int v : g[u]) {
            if (d[u] + 1 < d[v]) {
              d[v] = d[u] + 1;
              bfs.push(v);
            }
          }
        }
      }
      return r / 2 - 1;
    };

    cout << solve() << '\n';
    int s;
    cin >> s;
    while (s--) {
      int x;
      cin >> x;
      a[x - 1].clear();
      cout << solve() << '\n';
    }
  }
  return 0;
}