#include <bits/stdc++.h>
using namespace std;
#define int long long 
const int maxn=2000005;
int n,m;
vector<int> S[maxn], T[maxn]; 
typedef pair<int,int>pi;
vector<pi>adj[maxn];
bool vis[maxn];
bool slf[maxn];
int in[maxn];
void solve(){
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		T[i].clear();
		S[i].clear();
	}
	for(int i=1;i<=2*m;i++){
		adj[i].clear();
		vis[i]=slf[i]=in[i]=0;
	}
	for(int i=1;i<=n;i++){
		int num; cin >> num;
		for(int j=1;j<=num;j++){
			int x; cin >> x;
			S[i].push_back(x);
		}
	}
	for(int i=1;i<=n;i++){
		int num; cin >> num;
		for(int j=1;j<=num;j++){
			int x; cin >> x;
			T[i].push_back(x);
		}
	}
	
	for(int i=1;i<=n;i++){
		if(T[i].size() == 1){
			if(slf[T[i][0]]){
				cout<<-1<<"\n";return;
			}
			slf[T[i][0]]=1;
			adj[T[i][0]].push_back({T[i][0]+m,i});
			adj[T[i][0]].push_back({T[i][0]+m,i});
			in[T[i][0]]+=2;
			adj[T[i][0]+m].push_back({T[i][0],i});
			adj[T[i][0]+m].push_back({T[i][0],i});
			in[T[i][0]+m]+=2;
		} else{
			adj[T[i][0]].push_back({T[i][1],i});
			in[T[i][0]]++;
			adj[T[i][1]].push_back({T[i][0],i});
			in[T[i][1]]++;
		}
	}
	queue<int>qu;
	for(int i=1;i<=2*m;i++){
		if(in[i] == 0){
			vis[i]=1;
		}
		if(in[i] == 1){
			qu.push(i);
			vis[i]=1;
		}
	}
	while(qu.size()){
		int cur=qu.front();qu.pop();
		for(auto v:adj[cur]){
			if(!vis[v.first]){
				in[v.first]--;
				if(in[v.first]==1){
					qu.push(v.first);
					vis[v.first]=1;
				}
			}
		}
	}
	bool can=1;
	for(int i=1;i<=2*m;i++){
		if(!vis[i]){
			assert(in[i] != 1);
			can&=(in[i]==2);
		}
	}
	if(!can){
		cout<<-1<<"\n";
		return;
	}
	// property B
	int X=0,Y=0,XY=0;
	for(int i=1;i<=n;i++){
		sort(S[i].begin(),S[i].end());
		if(S[i][0] == i && S[i][1] == i+1){
			++XY;
		} else if(S[i][0] == i  || S[i][1] == i){
			++X;
		} else if(S[i][0] == i+1 || S[i][1] == i+1){
			++Y;
		}
	}
	if(X>Y)swap(X,Y);//X<=Y
	int diff=Y-X;
	if(diff<=XY){
		X+=diff;
		XY-=diff;
		cout<<X+XY/2<<"\n";
	} else{
		cout<<X+XY<<"\n";
	}
}
int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int tc; cin >> tc;
	while(tc--)solve();
}