#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define cmx(x,y) x = max(x,y)
#define cmn(x,y) x = min(x,y)
#define ary(k) array<int,k>
typedef pair<int,int> pii;
typedef vector<int> vi;
const int MM = 755,MV = 2*MM;
int n,k,dis[MV][MV],cnt[MV*2+500]; bitset<MM> tram[MM];
void solve(){
	cin >> n >> k;	
	rep(i,0,k){
		tram[i].reset();
	}
	rep(i,0,n+k) rep(j,0,n+k) dis[i][j] = 1e9;
	rep(i,0,2*(n+k)+1) cnt[i] = 0;
	// first k are trams, next are stops
	rep(i,0,k){
		int r; cin >> r;
		while(r--){
			int x; cin >> x; x--;
			tram[i][x] = 1;
			dis[i][x+k] = dis[x+k][i] = 1;
		}
	}
	rep(i,0,k) rep(j,i+1,k) if((tram[i]&tram[j]).count()){
		//cout << "TRAM " << i << " " << j << "\n";
		dis[i][j] = dis[j][i] = 1;		
	}
	rep(i,0,n+k) dis[i][i] = 0;
	auto rmv = [&](int x){
		if(x == int(1e9)) return;
		cnt[x]--;
	};
	auto add = [&](int x){
		if(x == int(1e9)) return;
		cnt[x]++;
	};
	auto query = [&](){
		int p = 2*(n+k);
		while(p >= 0 && !cnt[p]) p--;
		return p;
	};
	// get original cnts
	rep(i,0,n+k) rep(j,0,n+k){
		add(dis[i][j]);
	}
	int q; cin >> q; vi sus;
	rep(i,0,q){
		int x; cin >> x; x--;	
		sus.PB(x);
	}
	reverse(all(sus)); vi ans; ans.reserve(q+1);
	vi in(k,1);
	for(int x : sus){
		in[x] = 0;
	}

	// relax original
	auto relax = [&](int l){
		rep(i,0,n+k) rep(j,0,n+k){
			if(dis[i][j] > dis[i][l]+dis[l][j]){
				rmv(dis[i][j]);
				dis[i][j] = dis[i][l]+dis[l][j];
				add(dis[i][j]);
			}
		}
	};
	rep(l,0,k) if(in[l]){
		relax(l);	
	}
	/*
	rep(i,0,n+k) rep(j,0,n+k){
		cout << i << " " << j << " " << dis[i][j] << "\n";
	}*/
	rep(i,0,q){
		ans.PB(query());
		in[sus[i]] = 1;
		relax(sus[i]);
		/*
		cout << "ADD " << sus[i] << "\n";
	rep(i,0,n+k) rep(j,0,n+k){
		cout << i << " " << j << " " << dis[i][j] << "\n";
	}*/
	}
	ans.PB(query());
	reverse(all(ans));
	rep(i,0,sz(ans)) cout << ans[i]-2 << "\n";
}
signed main(){
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
	int t; cin >> t; while(t--) solve();
}