#include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
  int t; cin >> t; while(t--) {
    int n, m; cin >> n >> m;
    /*
    vector<int> par(m), sz(m,1), edges(m,0);
    iota(par.begin(),par.end(),0);
    auto onion = [&par](auto &onion, int x) -> int {return par[x]=(par[x]==x?x:onion(onion,par[x]));};
    auto merge = [&onion,&par,&sz,&edges](int x, int y) {
      x = onion(onion,x);
      y = onion(onion,y);
      if(sz[x]>sz[y]) swap(x,y);
      edges[y]++;
      if(x==y) return;
      par[x]=y;
      sz[y]+=sz[x];
      edges[y]+=edges[x];
    };
    */
    vector<vector<int>> s(n);
    int a = 0, b = 0, c = 0;
    for(int i=0;i<n;i++) {
      int sz; cin >> sz;
      int sth = 0;
      for(int x;sz--;) {
        cin >> x; x--;
        if(x==i) sth |= 1;
        if(x==(i+1)%n) sth |= 2;
      }
      if(sth==1) a++;
      else if(sth==2) b++;
      else c++;
    }
    for(int i=n;i--;) {
      int s, u, v; cin >> s >> u;
      if(s==2) cin>>v;
    }
    /*
    bool ok = 1;
    for(int i=0;i<m;i++) if(edges[onion(onion,i)]>sz[onion(onion,i)]) ok=0;
    if(!ok) {cout<<"-1\n"; continue;}
    */
    cout << min({a+c,b+c,(a+b+c)/2}) << "\n";
  }
}