#include<bits/stdc++.h>
using namespace std;

int t,n,m,p[5005],x,sub[5005];
vector<pair<int,int> > g[10005];
vector<int> tree[5005];
int p2[10005];
bool vis[10005];

void rset()
{
	for(int i=0;i<10005;i++)
	{
		p2[i] = -1;
		vis[i] = 0;
		g[i].clear();
		if(i<5005)
		{
			p[i] = 0;
			tree[i].clear();
			sub[i] = 0;
		}
	}
}

bool dfs(int i)
{
	if(i == n+m+1)
		return 1;
	vis[i] = 1;
	for(int k=0;k<g[i].size();k++)
		if(!vis[g[i][k].first] && g[i][k].second > 0)
			if(dfs(g[i][k].first))
			{
				p2[g[i][k].first] = i;
				return 1;
			}
	return 0;
}

void flow()
{
	int minf = 0,tflow = 0,i,k;
	while(dfs(0))
	{
		minf = INT_MAX;
		i = m+n+1;
		while(i != 0)
		{
			k = p2[i];
			for(int c=0;c<g[k].size();c++)
				if(g[k][c].first == i)
					minf = min(g[k][c].second,minf);
			i = k;
		}
		tflow += minf;
		i = m+n+1;
		while(i != 0)
		{
			k = p2[i];
			p2[i] = -1;
			for(int c=0;c<g[k].size();c++)
				if(g[k][c].first == i)
					g[k][c].second -= minf;
			
			for(int c=0;c<g[i].size();c++)
				if(g[i][c].first == k)
					g[i][c].second += minf;
			i = k;
		}
		for(int i=0;i<10005;i++)
			vis[i] = 0;
	}
	cout<<tflow<<"\n";
}

int dfs2(int i)
{
	int ans=1;
	for(int k=0;k<tree[i].size();k++)
		ans += dfs2(tree[i][k]);
	return sub[i] = ans;
}

int main()
{
	cin>>t;
	while(t--)
	{
		rset();
		scanf("%i%i",&n,&m);
		for(int i=2;i<n+1;i++)
		{
			scanf("%i",&p[i]);
			tree[p[i]].push_back(i);
		}
		for(int i=1;i<m+1;i++)
		{
			g[0].push_back(make_pair(i,1));
			g[i].push_back(make_pair(0,0));
			int p;
			scanf("%i",&p);
			while(p--)
			{
				scanf("%i",&x);
				g[i].push_back(make_pair(m+x,1));
				g[m+x].push_back(make_pair(i,0));
			}
		}
		g[m+1].push_back(make_pair(m+n+1,m));
		g[m+n+1].push_back(make_pair(m+1,0));
		dfs2(1);
		for(int i=2;i<n+1;i++)
		{
			g[m+i].push_back(make_pair(m+p[i],sub[i]));
			g[m+p[i]].push_back(make_pair(m+i,0));
		}
		flow();
	}
	return 0;
}