#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimise ("ofast")
#pragma GCC optimise("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int N = 750 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000000000000000;
const ll LOG = 25;
const int H = 313;

int n, k, mark[N], mark2[N][N], d[N][N];
vi com[N];
vi tot_com[N];
queue<int> q[N];

void solve(int v){
	while(q[v].size()){
		int fr = q[v].front();
		q[v].pop();
		for (auto u:tot_com[fr]){
			if (d[v][u] > d[v][fr] + 1){
				d[v][u] = d[v][fr] + 1;
				q[v].push(u);
			}
		}
	}
	return;
}

int calc(){
	int mx = 0;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= n; j++){
			if (d[i][j] <= k) mx = max(mx, d[i][j]);
		}
	}
	return mx;
}

void Main(){
	cin >> n >> k;
	memset(mark, 0, sizeof mark);
	for (int i = 0; i < N; i++) com[i].clear();
	for (int i = 0; i < N; i++) tot_com[i].clear();
	memset(d, 31, sizeof d);
	for (int i = 1; i <= k; i++){
		int t;
		cin >> t;
		for (int j = 0; j < t; j++){
			int x;
			cin >> x;
			com[i].pb(x);
		}
		
	}
	
	vi Q;
	int s;
	cin >> s;
	for (int i = 0; i < s; i++){
		int x;
		cin >> x;
		Q.pb(x);
		mark[x] = 1;
	}
	for (int i = 1; i <= k; i++){
		if (mark[i] == 0){
			for (int j = 0; j < com[i].size(); j++){
				for (int l = j + 1; l < com[i].size(); l++){
					mark2[com[i][j]][com[i][l]] = 1;
					mark2[com[i][l]][com[i][j]] = 1;
				}
			}	
		}
	}
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= n; j++){
			if (mark2[i][j]) tot_com[i].pb(j);
		}
	}
	for (int i = 1; i <= n; i++) {d[i][i] = -1; q[i].push(i);}
	for (int i = 1; i <= n; i++)solve(i);
	vi ans;
	ans.pb(calc());
	for (int i = s - 1; i >= 0; i--){
		int v = Q[i];
		memset(mark, 0, sizeof mark);
		for (auto u:com[v]){
			mark[u] = 1;
		}
		for (int j = 1; j <= n; j++){
			int mn = d[j][com[v][0]];
			int ki = com[v][0];
			for (auto u:com[v]){
				if (mn > d[j][u]){
					mn = d[j][u];
					ki = u;
				}
			}
			for (auto u:com[v]){
				if (d[j][u] > mn + 1){
					d[j][u] = mn + 1;
					q[j].push(u);
				}
			}
			solve(j);
		}
		ans.pb(calc());
	}
	reverse(all(ans));
	for (auto u:ans)cout << u << '\n';
	return;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while (t--){
		Main();
	}
	



}