//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n,k;
int dist[1505][1505];
vector<int> vec[808];
int ind[808];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n>>k;
		memset(dist,0x3f,sizeof(dist));
		for(int i=1;i<=n+k;i++)
			dist[i][i]=0;
		for(int i=1;i<=k;i++)
		{
			int s;
			cin>>s;
			vec[i].resize(s);
			for(auto &x:vec[i])
			{
				cin>>x;
				dist[x][i+n]=dist[i+n][x]=1;
			}
		}
		int s;
		cin>>s;
		for(int i=1;i<=k;i++)
			ind[i]=s+1;
		for(int i=1;i<=s;i++)
		{
			int x;
			cin>>x;
			ind[x]=i;
		}
		vector<pii> v;
		for(int i=1;i<=k;i++)
			v.pb(ind[i],i);
		rsrt(v);
		int p=0;
		vector<int> vans;
		auto floyd=[&](int x)
		{
			for(int i=1;i<=n+k;i++)
				for(int j=1;j<=n+k;j++)
					dist[i][j]=min(dist[i][j],dist[i][x]+dist[x][j]);
		};
		for(int i=1;i<=n;i++)
			floyd(i);
		for(int i=s+1;i;i--)
		{
			while(p<sz(v)&&v[p].first>=i)
			{
				floyd(n+v[p].second);
				p++;
			}
			int ans=0;
			for(int j=1;j<=n;j++)
				for(int k=1;k<=n;k++)
					if(dist[j][k]!=inf)
						ans=max(ans,dist[j][k]);
			vans.pb(max(0,ans/2-1));
		}
		rev(vans);
		for(auto x:vans)
			cout<<x<<'\n';
	}
	return 0;
}