#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
    size_t operator()(pair<uint64_t,uint64_t> x) const {
        return (x.first<<21ll)+x.second;
    }
};
int n,m;
unordered_set<pair<int,int>,custom_hash> adj[1000005];
int bob[1000005],used[1000005],v[1000005],v2[1000005];
int pos[2][1000005][2],ans,tmp;
bool can;
void dfs(int x, int va, int p){
	if(used[x]!=-1){
		can=false;
		return;
	}
	bob[va]=x;
	used[x]=va;
	for(auto i:adj[x]){
		if(i.first==p) continue;
		dfs(i.first,i.second,x);
	}
}
pair<int,int> check(int x){
	pair<int,int> ret={1,(int)adj[x].size()};
	v[x]=1;
	for(auto i:adj[x]){
		if(v[i.first]) continue;
		pair<int,int> kid=check(i.first);
		ret.first+=kid.first;
		ret.second+=kid.second;
	}
	return ret;
}
vector<int> sing;
int key[1000005];
void keychain(int x){
	v2[x]=1; key[x]=1;
	if((int)adj[x].size()==1) sing.push_back(x);
	for(auto i:adj[x]){
		if(v2[i.first]) continue;
		keychain(i.first);
	}
}
vector<pair<int,pair<int,int> > > chain;
void getloop(int x, int p){
	key[x]=0;
	for(auto i:adj[x]){
		if(i.second==p) continue;
		chain.push_back({i.second,{x,i.first}});
		if(key[i.first]==0) continue;
		getloop(i.first,i.second);
		break;
	}
}
int subt[1000005],rev[1000005];
pair<int,int> revc[1000005];
void up(int x, int va){
	if(va>=revc[x].first){
		revc[x].second=revc[x].first;
		revc[x].first=va;
	}
	else if(va>revc[x].second) revc[x].second=va;
}
void pretree(int x, int p){
	subt[x]=0;
	revc[x]={0,0};
	for(auto i:adj[x]){
		if(i.first==p) continue;
		pretree(i.first,x);
		subt[x]+=subt[i.first];
		if(pos[0][i.second][0]==i.first||pos[0][i.second][1]==i.first){
			subt[x]++;
			up(x,rev[i.first]+1);
		}
		else if(pos[0][i.second][0]==x||pos[0][i.second][1]==x){
			up(x,rev[i.first]-1);
		}
		else up(x,rev[i.first]);
	}
	rev[x]=revc[x].first;
}
void rer(int x, int p){
	//cout << x << ' ' << subt[x] << ' ' << rev[x] << '\n';
	tmp=max(tmp,subt[x]-rev[x]);
	for(auto i:adj[x]){
		if(i.first==p) continue;
		subt[x]-=subt[i.first];
		if(pos[0][i.second][0]==i.first||pos[0][i.second][1]==i.first){
			subt[x]--;
			if(revc[x].first==rev[i.first]+1) rev[x]=revc[x].second;
		}
		else if(pos[0][i.second][0]==x||pos[0][i.second][1]==x){
			if(revc[x].first==rev[i.first]-1) rev[x]=revc[x].second;
		}
		else if(revc[x].first==rev[i.first]) rev[x]=revc[x].second;
		subt[i.first]+=subt[x];
		pair<int,int> org=revc[i.first];
		if(pos[0][i.second][0]==x||pos[0][i.second][1]==x){
			subt[i.first]++;
			up(i.first,rev[x]+1);
		}
		else if(pos[0][i.second][0]==x||pos[0][i.second][1]==x){
			up(i.first,rev[x]-1);
		}
		else up(i.first,rev[x]);
		rev[i.first]=revc[i.first].first;
		rer(i.first,x);
		
		subt[i.first]-=subt[x];
		if(pos[0][i.second][0]==x||pos[0][i.second][1]==x){
			subt[i.first]--;
		}
		revc[i.first]=org;
		rev[i.first]=revc[i.first].first;
		if(pos[0][i.second][0]==i.first||pos[0][i.second][1]==i.first){
			subt[x]++;
		}
		subt[x]+=subt[i.first];
		rev[x]=revc[x].first;
	}
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t--){
		ans=0;
		cin >> n >> m;
		for(int i=0; i<=n; i++){
			bob[i]=-1;
			pos[0][i][0]=pos[0][i][1]=-1;
			pos[1][i][0]=pos[1][i][1]=-1;
		}
		for(int i=0; i<=m; i++) used[i]=-1;
		can=true;
		vector<pair<int,int> > sure;
		for(int i=0; i<2; i++){
			for(int j=0; j<n; j++){
				int num;
				cin >> num;
				for(int k=0; k<num; k++){
					cin >> pos[i][j][k];
				}
				if(i==1&&num==2){
					adj[pos[i][j][0]].insert({pos[i][j][1],j});
					adj[pos[i][j][1]].insert({pos[i][j][0],j});
				}
				else if(i==1) sure.push_back({j,pos[i][j][0]});
			}
		}
		for(auto i:sure) dfs(i.second,i.first,-1);
		if(!can){
			cout << -1 << '\n';
			for(int i=0; i<=n; i++){
				bob[i]=-1;
			}
			for(int i=0; i<=m; i++){
				adj[i].clear();
				v[i]=v2[i]=key[i]=0;
				subt[i]=rev[i]=0;
				revc[i]={0,0};
				used[i]=0;
			}
			sing.clear();
			chain.clear();
			ans=0; tmp=0;
			can=true;
			continue;
		}
		for(int i=0; i<=m; i++) v[i]=0,v2[i]=0;
		for(int i=1; i<=m; i++){
			if(used[i]!=-1) continue;
			if(v[i]) continue;
			pair<int,int> lol=check(i);
			lol.second/=2;
			if(lol.second>lol.first) can=false;
			else if(lol.second==lol.first){
				sing.clear();
				keychain(i);
				while(!sing.empty()){
					int x=sing.back();
					sing.pop_back();
					pair<int,int> ed=*adj[x].begin();
					adj[x].clear();
					bob[ed.second]=x;
					used[x]=ed.second;
					adj[ed.first].erase({x,ed.second});
					if((int)adj[ed.first].size()==1) sing.push_back(ed.first);
				}
			}
			else{
				assert(lol.first==lol.second+1);
				tmp=0;
				pretree(i,-1);
				rer(i,-1);
				ans+=tmp;
			}
		}
		if(!can){
			cout << -1 << '\n';
			for(int i=0; i<=n; i++){
				bob[i]=-1;
			}
			for(int i=0; i<=m; i++){
				adj[i].clear();
				v[i]=v2[i]=key[i]=0;
				subt[i]=rev[i]=0;
				revc[i]={0,0};
				used[i]=0;
			}
			sing.clear();
			chain.clear();
			ans=0; tmp=0;
			can=true;
			continue;
		}
		for(int i=1; i<=m; i++){
			if(key[i]){
				chain.clear();
				getloop(i,-1);
				int t1=0,t2=0,idk=0;
				for(auto [j,k]:chain){
					if((pos[0][j][0]==k.first||pos[0][j][0]==k.second)&&(pos[0][j][1]==k.first||pos[0][j][1]==k.second)){
						idk++;
					}
					else if(pos[0][j][0]==k.first||pos[0][j][1]==k.first){
						t1++;
					}
					else if(pos[0][j][0]==k.second||pos[0][j][1]==k.second){
						t2++;
					}
				}
				if(t1>t2) swap(t1,t2);
				int dif=min(t2-t1,idk);
				t1+=dif;
				idk-=dif;
				ans+=min(t1,t2)+idk/2;
			}
		}
		for(int i=0; i<n; i++){
			if(bob[i]!=-1){
				if(pos[0][i][0]==bob[i]||pos[0][i][1]==bob[i]) ans++;
			}
		}
		cout << ans << '\n';
		for(int i=0; i<=n; i++){
			bob[i]=-1;
		}
		for(int i=0; i<=m; i++){
			adj[i].clear();
			v[i]=v2[i]=key[i]=0;
			subt[i]=rev[i]=0;
			revc[i]={0,0};
			used[i]=0;
		}
		sing.clear();
		chain.clear();
		ans=0; tmp=0;
		can=true;
	}
}