#include <bits/stdc++.h>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return a<b?(a=b,true):false;}
template<typename T>bol _min(T&a,T b){return b<a?(a=b,true):false;}
std::vector<uint>S[1000005],T[1000005],Way[1000005],Son[1000005],Edge[1000005],V[1000005];
uint Cnt1[1000005],Cnt2[1000005],Siz[1000005],C[1000005],Id[1000005],tp;
voi dfs(uint p){
    Siz[Id[p]=tp]++,V[tp].push_back(p);
    for(auto s:Way[p])if(!~Id[s])dfs(s);
}
uint n,m;
uint Fath[1000005];
voi dfs2(uint p,uint f){
    Fath[p]=f;for(auto s:Way[p])if(s!=f)dfs2(s,p);
}
uint solve1(uint id){
    // puts("qwq");
    uint r=-1,ans=0;
    for(auto p:V[id])if(~C[p])r=p;
    dfs2(r,-1);
    for(auto p:V[id])
        if(p==r)ans+=S[C[p]].size();
        else for(auto e:Edge[p])if(!(T[e][0]^T[e][1]^p^Fath[p]))
            for(auto s:S[e])if(s==p)ans++;
    // printf(":%u\n",ans);
    return ans;
}
uint solve2(uint id){
    static uint Deg[1000005];
    uint ans=0;
    std::queue<uint>Q;
    for(auto p:V[id])if((Deg[p]=Way[p].size())==1)Q.push(p);
    while(Q.size()){
        uint p=Q.front();Q.pop();Deg[p]=0;
        for(auto e:Edge[p])if(Deg[T[e][0]^T[e][1]^p]){
            uint t=T[e][0]^T[e][1]^p;if(--Deg[t]==1)Q.push(t);
            for(auto s:S[e])if(s==p)ans++;
        }
    }
    // printf("%u\n",ans);
    std::vector<uint>A;
    // for(auto p:V[id])if(Deg[p])A.push_back(p);
    for(auto p:V[id])if(Deg[p]){
        do{
            A.push_back(p);
            uint t=-1;
            for(auto s:Way[p])
                if(Deg[s]&&(A.size()==1||s!=A[A.size()-2]))
                    t=s;
            p=t;
        }while(~p&&p!=A[0]);
        break;
    }
    // printf(":%u\n",(uint)A.size());
    uint cnt1=0,cnt2=0,cnt3=0;
    if(A.size()>2){
        for(uint i=0;i<A.size();i++)for(auto e:Edge[A[i]])
            if(!(A[i]^A[(i+1)%A.size()]^T[e][0]^T[e][1])){
                if(S[e].size()==2)cnt3++;else if(S[e].size()==1)(A[i]==S[e][0]?cnt1:cnt2)++;
            }
    }else{
        bol op=1;
        for(auto e:Edge[A[0]])if(!(A[0]^A[1]^T[e][0]^T[e][1])){
            if(S[e].size()==2)cnt3++;
            else if(S[e].size()==1)(((A[0]==S[e][0])==op)?cnt1:cnt2)++;
            op^=1;
        }
    }
    if(cnt1>cnt2)std::swap(cnt1,cnt2);
    if(cnt1+cnt3<=cnt2)ans+=cnt1+cnt3;
    else ans+=(cnt1+cnt2+cnt3)/2;
    return ans;
}
uint Op[1000005],Up[1000005];
uint Dfn[1000005],cnt;
uint Back[1000005];
voi dfs3(uint p){
    Son[p].clear(),Up[p]=~Fath[p]&&!Op[p]?Up[Fath[p]]:p;
    if(Op[p])Son[Up[Fath[p]]].push_back(p),Dfn[p]=cnt++;else if(!~Fath[p])cnt=0,Dfn[p]=cnt++;else Dfn[p]=-1;
    for(auto s:Way[p])if(s!=Fath[p])dfs3(s);
    for(auto s:Son[p])Fath[s]=p;
    if(~Dfn[p])Back[Dfn[p]]=p;
}
int Dep[1000005],W[1000005];
uint check(int v){
    uint ans=0;
    for(uint i=0;i<cnt;i++)W[Back[i]]=0;
    for(uint i=cnt-1,p;i;i--){
        p=Back[i];
        if(Op[p]==1)_max(W[Fath[p]],W[p]+1),ans++;
        else if(Op[p]==2)_max(W[Fath[p]],W[p]-1);
        else if(W[p]+1+Dep[Fath[p]]<=v)_max(W[Fath[p]],W[p]+1),ans++;
        else _max(W[Fath[p]],W[p]-1);
    }
    return ans;
}
uint solve3(uint id){
    uint rot=V[id][0];
    dfs2(rot,-1),Op[rot]=0;
    for(auto p:V[id])if(p!=rot)for(auto e:Edge[p])if(!(T[e][0]^T[e][1]^p^Fath[p])){
        uint a=0;
        for(auto s:S[e])if(s==p)a|=1;else a|=2;
        Op[p]=a;
    }
    dfs3(rot);if(cnt==1)return 0;
    int v=Dep[rot]=0;
    for(uint i=1,p;i<cnt;i++)p=Back[i],_max(v,Dep[p]=Op[p]==1?Dep[Fath[p]]+1:Dep[Fath[p]]-1);
    // for(uint i=0;i<cnt;i++)printf("%u %u\n",Fath[Back[i]]+1,Back[i]+1);
    int l=v,r=cnt-1;
    bol ok=1;
    for(uint i=0;i<cnt&&ok;i++)ok=Op[Back[i]]<3;
    int ans=0;
    if(ok)ans=check(l)-l;
    else if(r-l<=2000){
        for(int i=l;i<=r;i++){
            int v=check(i)-i;
            _max(ans,v);
            if(v==r-i)break;
        }
    }
    else{
        // puts("qwq");
        for(int i=l;i<=l+10;i++)_max<int>(ans,check(i)-i);
        for(int i=2;i<=5;i++)if(r/i>l+10)_max<int>(ans,check(r/i)-r/i);
        for(int i=2;i<=5;i++)if(r/i+1>l+10)_max<int>(ans,check(r/i+1)-r/i-1);
    }
    // for(int i=l;i<=r;i++)printf("%d ",check(i));
    // puts("");
    // for(int i=l;i<=r&&i<=l+10;i++)printf("%d ",check(i)-i);
    // puts("");
    // printf("ans:%d\n",ans);
    return ans;
}
uint read(){
    uint ans=0;chr c;do c=getchar();while(c>'9'||c<'0');
    do ans=ans*10+(c^'0'),c=getchar();while(c<='9'&&c>='0');return ans;
}
voi solve()
{
    n=read(),m=read(),tp=0;
    for(uint i=0;i<m;i++)Way[i].clear(),Edge[i].clear(),C[i]=-1,Id[i]=-1;
    for(uint i=0;i<n;i++){
        S[i].resize(read());for(auto&s:S[i])s=read()-1;
    }
    for(uint i=0,d;i<n;i++){
        T[i].resize(d=read());for(auto&s:T[i])s=read()-1;
        std::vector<uint>User;
        for(auto w:S[i]){
            bol ok=false;
            for(uint t:T[i])if(w==t)ok=true;
            if(ok)User.push_back(w);
        }
        S[i]=User;
        if(d==2){
            Way[T[i][0]].push_back(T[i][1]);
            Way[T[i][1]].push_back(T[i][0]);
            Edge[T[i][0]].push_back(i);
            Edge[T[i][1]].push_back(i);
        }
        else C[T[i][0]]=i;
    }
    for(uint i=0;i<m;i++)if(!~Id[i])Siz[tp]=Cnt1[tp]=Cnt2[tp]=0,V[tp].clear(),dfs(i),tp++;
    for(uint i=0;i<n;i++)if(T[i].size()==1)Cnt1[Id[T[i][0]]]++;else Cnt2[Id[T[i][0]]]++;
    for(uint i=0;i<tp;i++)if(Cnt1[i]+Cnt2[i]>Siz[i]){puts("-1");return;}
    {
        bol ok=1;
        for(uint i=0;i<n&&ok;i++)if(S[i].size())ok=false;
        if(ok){puts("0");return;}
    }
    uint ans=0;
    for(uint i=0;i<tp;i++)
        if(Cnt1[i])ans+=solve1(i);
        else if(Cnt2[i]==Siz[i])ans+=solve2(i);
        else ans+=solve3(i);
    printf("%u\n",ans);
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#else
#endif
    uint t=read();
    while(t--)solve();
    return 0;
}

/*

g++ game.cpp -o game -std=c++14 -Wall -fsanitize=address,undefined -DMYEE

*/