#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define I inline
#define inf 1e9
using namespace std;

const int N = 1510;
int f[N][N],a[N],b[N],ans[N];
int n,m;

I void out() {
	
}
I void trans(int x) {
	for(int i=1;i<=m+n;++i)
		for(int j=1;j<=m+n;++j) 
			f[i][j]=f[j][i]=min(f[i][j],f[i][x]+f[x][j]);
}
I int gans() {
	int ret=0;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j) {
			if(f[i][j]==1e9) continue;
			ret=max(ret,f[i][j]/2-1);
		}
	return ret;
}
I int read() {
	int ret=0,w=1; char ch;
	while((ch=getchar())>'9'||ch<'0'&&ch!='-'); if(ch=='-') w=-1; else ret=ch-'0';
	while((ch=getchar())>='0'&&ch<='9') ret=ret*10+ch-'0';
	return ret*w; 
}
int main()
{
	int T; cin>>T;
	while(T--) {
		cin>>n>>m;
		for(int i=1;i<=m;++i) b[i]=0;
		for(int i=1;i<=m+n;++i)
			for(int j=1;j<=m+n;++j)
				f[i][j]=inf;
		for(int i=1;i<=n+m;++i) f[i][i]=0;
		for(int i=1;i<=m;++i) {
			int x; x=read();
			for(int j=1;j<=x;++j) {
				int y; y=read();
				f[i+n][y]=f[y][i+n]=1;
			}
		}

		//printf("%d\n",gans());
		int q=read();
		for(int i=1;i<=q;++i) a[i]=read(),b[a[i]]=1;
		for(int i=1;i<=m;++i) if(!b[i]) trans(i+n);
		for(int i=1;i<=n;++i) trans(i);
		for(int i=q;i>=1;--i) {
			ans[i]=gans();
			trans(a[i]+n);
		}
		ans[0]=gans();
		for(int i=0;i<=q;++i) printf("%d\n",ans[i]);
	}
}