#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<int, int>> st;
#define MAX 1010
vector<int> ls[MAX];
int chk[MAX];
int mp[MAX][MAX];
int p[MAX];
int qv[MAX];
int ans[MAX];
int find(int a) {
	if (p[a] == a) return a;
	return p[a] = find(p[a]);
}
bool uni(int a, int b) {
	a = find(a);
	b = find(b);
	if (a == b) return true;
	p[a] = b;
	return false;
}
int cnt[MAX];
int dv[MAX];
void solve() {
	int N, K;
	cin >> N >> K;
	int i, j, a, r;
	for (i = 1; i <= N; i++) p[i] = i;
	for (i = 1; i <= K; i++) {
		cin >> r;
		while (r--) {
			cin >> a;
			ls[i].push_back(a);
		}
	}
	int Q;
	cin >> Q;
	for (i = 1; i <= Q; i++) {
		cin >> qv[i];
		chk[qv[i]] = 1;
	}
	for (i = 1; i <= N; i++) for (j = 1; j <= N; j++) mp[i][j] = (i == j ? 0 : N + 1);
	/*
	auto add = [&](int u, int v) {
		if (uni(u, v)) {
			for (i = 1; i <= N; i++) {
				for (j = 1; j <= N; j++) {
					mp[i][j] = min(mp[i][j], 1 + min(mp[i][u] + mp[v][j], mp[i][v] + mp[u][j]));
				}
			}
		}
		};
	*/
	for (int q = 1; q <= K; q++) {
		if (!chk[q]) {
			for (j = 1; j <= N; j++) {
				dv[j] = N + 10;
				for (auto v : ls[q]) dv[j] = min(dv[j], mp[j][v]);
			}
			for (i = 1; i <= N; i++) for (j = 1; j <= N; j++) mp[i][j] = min(mp[i][j], dv[i] + dv[j] + 1);
		}
	}
	auto getans = [&]() {
		int mx = 0;
		int i, j;
		for (i = 1; i <= N; i++) {
			for (j = i + 1; j <= N; j++) {
				if (mp[i][j] <= N) mx = max(mx, mp[i][j]);
			}
		}
		return mx;
		};
	ans[Q + 1] = getans();
	for (i = Q; i >= 1; i--) {
		int q = qv[i];
		for (j = 1; j <= N; j++) {
			dv[j] = N + 10;
			for (auto v : ls[q]) dv[j] = min(dv[j], mp[j][v]);
		}
		for (int i = 1; i <= N; i++) for (j = 1; j <= N; j++) mp[i][j] = min(mp[i][j], dv[i] + dv[j] + 1);
		ans[i] = getans();
	}
	for (i = 1; i <= Q + 1; i++) cout << ans[i] - 1 << '\n';
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int T;
	cin >> T;
	while (T--) solve();
}