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

const int N=511;

vector<int>lnk[N];

int n,match[N],Q[N],head,tail;

int pred[N],base[N],start,finish,newbase;

bool inq[N],inb[N];

void push(int u)
{
    Q[tail++]=u;
    inq[u]=1;
}

int pop()
{
    return Q[head++];
}

int lca(int u,int v)
{
    bool inpath[N];
    for(int i=0;i<n;i++)
        inpath[i]=0;
    while(true){u=base[u];inpath[u]=1;if(u==start) break;u=pred[match[u]];}
    while(true){v=base[v];if(inpath[v]) break;v=pred[match[v]];}
    return v;
}

void ResetTrace(int u)
{
    int v;
    while(base[u]!=newbase)
    {
        v=match[u];
        inb[base[u]]=inb[base[v]]=1;
        u=pred[v];
        if(base[u]!=newbase)
            pred[u]=v;
    }
}

void Blossom(int u,int v)
{
    newbase=lca(u,v);
    for(int i=0;i<n;i++)
        inb[i]=0;
    ResetTrace(u);ResetTrace(v);
    if(base[u]!=newbase)
        pred[u]=v;
    if(base[v]!=newbase)
        pred[v]=u;
    for(int i=0;i<n;i++)
        if(inb[base[i]])
        {
            base[i]=newbase;
            if(!inq[i])
                push(i);
        }
}

bool find(int u)
{
    bool found=false;
    for(int i=0;i<n;i++)
        pred[i]=-1,base[i]=i;
    for(int i=0;i<n;i++)
        inq[i]=0;
    start=u,finish=-1;head=tail=0;push(start);
    while(head<tail)
    {
        int u=pop();
        for(int i=lnk[u].size()-1;i>=0;i--)
        {
            int v=lnk[u][i];
            if(base[u]!=base[v]&&match[u]!=v)
            {
                if(v==start||(match[v]>=0&&pred[match[v]]>=0))
                    Blossom(u,v);
                else if(pred[v]==-1)
                {
                    pred[v]=u;
                    if(match[v]>=0)
                        push(match[v]);
                    else
                    {
                        finish=v;
                        return 1;
                    }
                }
            }
        }
    }
    return found;
}

void aug()
{
    int u=finish,v,w;
    while(u>=0){v=pred[u];w=match[v];match[v]=u;match[u]=v;u=w;}
}

int T;

void add(int u,int v)
{
    lnk[u].push_back(v);
    lnk[v].push_back(u);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>T;
    while(T--)
    {
        for(int i=0;i<n;i++)
            lnk[i].clear(),pred[i]=base[i]=inq[i]=inb[i]=0;
        start=finish=newbase=0;
        int L,R;
        cin>>L>>R;
        n=L-1;
        for(int i=1;i<=R;i++)
        {
            int a,b,c;
            cin>>a>>b>>c;
            int sn=n;
            n+=a;
            for(int j=1;j<b*2;j++)
                add(n+j,n+j+1);
            n+=b*2;
            for(int j=1;j<=c;j++)
                add(n+j,n+j+c);
            n+=c;
            int en=n;
            n+=c;
            int t;
            cin>>t;
            while(t--)
            {
                int x;
                cin>>x;
                x--;
                for(int j=sn+1;j<=en;j++)
                    add(x,j);
            }
        }
        int ans=-L;
        n++;
        for(int i=0;i<n;i++)
            match[i]=-1;
        for(int i=0;i<n;i++)
            if(match[i]==-1)
            {
                if(find(i))
                    aug(),ans++;
                else if(i<L)
                {
                    ans=-1;
                    break;
                }
            }
        // cerr<<MC<<endl;
        cout<<ans<<"\n";
    }    
}