//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;
vector<int> stops[808];
int ind[808];
int dist[1505][808];
vector<int> G[808];
int ans[808];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n>>k;
		for(int i=1;i<=k;i++)
		{
			int s;
			cin>>s;
			stops[i].resize(s);
			for(auto &x:stops[i])
				cin>>x;
		}
		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;
		}
		for(int i=1;i<=n;i++)
			G[i].clear();
		for(int i=1;i<=k;i++)
			for(auto x:stops[i])
				G[x].pb(i);
		memset(ans,0,sizeof(ans));
		for(int i=1;i<=n;i++)
		{
			memset(dist,0,sizeof(dist));
			dist[i][0]=s+1;
			priority_queue<array<int,3>> pq;
			pq.push({s+1,i,0});
			while(!pq.empty())
			{
				int d=pq.top()[0];
				int u=pq.top()[1];
				int c=pq.top()[2];
				pq.pop();
				if(d!=dist[u][c]) continue;
				if(u<=n&&c<=n)
				{
					for(auto L:G[u])
					{
						int nd=min(d,ind[L]);
						if(nd>dist[L+n][c+1])
						{
							dist[L+n][c+1]=nd;
							pq.push({nd,L+n,c+1});
						}
					}
				}
				else
				{
					for(auto v:stops[u-n])
					{
						int nd=d;
						if(nd>dist[v][c])
						{
							dist[v][c]=nd;
							pq.push({nd,v,c});
						}
					}
				}
			}
			for(int j=1;j<=n;j++) if(i!=j)
				for(int k=1;k<=n;k++)
					if(dist[j][k-1]<=dist[j][k])
					{
						for(int x=dist[j][k-1]+1;x<=dist[j][k];x++)
							ans[x]=max(ans[x],k);
					}
					else dist[j][k]=dist[j][k-1];
		}
		for(int i=1;i<=s+1;i++)
			cout<<ans[i]-1<<'\n';
	}
	return 0;
}