/*input
1
4 10
1 9
1 7
1 10
1 10
1 9
1 7
2 10 8
2 10 3
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const int INF=0x3f3f3f3f;
const ll INF64=4e18;
const int MOD=1e9+7;
const ld PI=acos(-1);
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"\n");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;  
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
bool ys[maxn],vis[maxn];
vector<pii> v[maxn];
int dp[maxn][2];
int ed=0,sz=0;
int fc=0,fx;
vector<int> stf[maxn];
pii par[maxn];
vector<pii> cyc;
bool isc[maxn];
vector<int> vv;
void dfs(int u,int pe){
    vis[u]=1;
    if(ys[u]) ++fc,fx=u;
    ++sz;
    for(auto x:v[u]){
        ++ed;
        if(!vis[x.f]){
            par[x.f]={u,x.s};
            if(sz(stf[x.s])>1) vv.pb(x.s);
            dfs(x.f,x.s);
        }
        else if(x.s!=pe){
            if(sz(cyc)) continue;
            int z=u;
            while(z!=x.f){
                cyc.pb(par[z]);
                z=par[z].f;
            }
            cyc.pb({u,x.s});
        }
    }
}
int get(int u,int p){
    int ans=0;
    for(auto x:v[u]){
        if(x.f==p or isc[x.f]) continue;
        ans+=get(x.f,u);
        for(int z:stf[x.s]) if(z==x.f) ++ans; 
    }
    return ans;
}
int sm[maxn],dep[maxn];
int cnt=0;
int he=0;
void dfs2(int u,int p){
    sm[u]=0;
    for(auto x:v[u]){
        if(x.f==p) continue;
        dfs2(x.f,u);
        if(!sz(stf[x.s])) continue;
        ++he;
        if(sz(stf[x.s])==2) continue;
        if(stf[x.s][0]==x.f){
            sm[x.f]++;
        }
        else{
            ++cnt;
            sm[x.f]--;
        }
    }
}
int mx=0,pp=0;
void dfs3(int u,int p){
    for(auto x:v[u]){
        if(x.f==p) continue;
        sm[x.f]+=sm[u];
        dfs3(x.f,u);
    }
}
void dfs4(int u,int p,int d){
   // cout<<u<<' '<<(d+sm[u])<<'\n';
    if(d+sm[u]>mx) mx=d+sm[u],pp=u;
    for(auto x:v[u]){
        if(x.f==p) continue;
        dfs4(x.f,u,d+(sz(stf[x.s])==2));
    }
}
void solve(){
    int n,m;
    cin>>n>>m;
    REP1(i,m) ys[i]=vis[i]=isc[i]=sm[i]=0,v[i].clear();
    REP(i,n) stf[i].clear();
    REP(i,n){
        int x;
        cin>>x;
        REP(j,x){
            int k;
            cin>>k;
            stf[i].pb(k);
        }
    }
    bool ok=1;
    int ans=0;
    REP(i,n){
        int k;
        cin>>k;
        if(k==1){
            cin>>k;
            if(ys[k]){
                ok=0;
            }
            ys[k]=1;
            for(int x:stf[i]){
                if(x==k) ++ans;
            }
        }
        else{
            int a,b;
            cin>>a>>b;
            vector<int> nw;
            for(int x:stf[i]){
                if(x==a or x==b) nw.pb(x);
            }
            stf[i]=nw;
            v[a].pb({b,i}),v[b].pb({a,i});
        }
    }
    if(!ok){
        cout<<"-1\n";
        return;
    }
    REP1(i,m){
        if(!vis[i]){
            ed=sz=he=0;
            fc=0;
            cyc.clear();
            vv.clear();
            dfs(i,-1);
            if(ed>2*(sz-fc)){
                cout<<"-1\n";
                return;
            }
            if(!ed) continue;
            if(ed==2*(sz-fc)){
                if(fc){
                    //tree with one fixed
                    ans+=get(fx,-1);
                }
                else{
                    //n n graph
                    for(auto a:cyc){
                        isc[a.f]=1;
                    }
                    int c1=0,c2=0,ca=0;
                    for(auto a:cyc){
                        ans+=get(a.f,-1);
                        if(!sz(stf[a.s])) continue;
                        if(sz(stf[a.s])==2) ++ca;
                        else if(stf[a.s][0]==a.f) ++c2;
                        else ++c1; 
                    }
                    if(c1+ca<c2) ans+=c1+ca;
                    else if(c2+ca<c1) ans+=c2+ca;
                    else ans+=(c1+c2+ca)/2;
                }
            }
            else{
                cnt=0;
                dfs2(i,-1);
                sm[i]+=cnt;
                dfs3(i,-1);
                mx=-1;
                dfs4(i,-1,0);
                mx=-1;
                int o=pp;
                dfs4(pp,-1,0);
                ans+=he-(mx+sm[o]+1)/2;
            }
        }
    }
    cout<<ans<<'\n';
}   
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    //freopen("ex_game2.in","r",stdin);
    int t;
    cin>>t;
    while(t--) solve();
}