#include<bits/stdc++.h>
using namespace std;
constexpr int N=1000013;
const int P=1e9+7;
typedef long long ll;
typedef long double ld;
vector<int>f[N],g[N];
ll cnt[N];int in[N];
void solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)f[i].clear(),cnt[i]=in[i]=0,g[i].clear();
    for(int i=1;i<=n;i++) {
        int o,x,y;
        cin>>o;
        if(o==1) {
            cin>>x;
            while(x--)cin>>y,f[i].push_back(y);
        }else {
            cin>>x>>y,g[i].push_back(x),g[i].push_back(y),in[x]++,in[y]++;
        }
    }
    queue<int>q;
    for(int i=1;i<=n;i++)if(!in[i])q.push(i),cnt[i]=1;
    while(!q.empty()) {
        int x=q.front();
        q.pop();
        for(auto i:g[x]) {
            if(!--in[i])cnt[i]+=cnt[x],q.push(i);
        }
    }
    map<int,ll>cnt2;
    for(int i=1;i<=n;i++)for(auto c:f[i])cnt2[c]+=cnt[i];
    ll mx=0,tot=0;
    for(auto[x,y]:cnt2)mx=max(mx,y),tot+=y;
    cout<<min((tot-mx)*2,tot)<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T=1;cin>>T;
    while(T--)solve();
}