#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OPFI(x) freopen(#x".in", "r", stdin);\
                freopen(#x".out", "w", stdout)
#define REP(i, a, b) for(int i=(a); i<=(b); ++i)
#define REPd(i, a, b) for(int i=(a); i>=(b); --i)
inline ll rd(){
    ll r=0, k=1; char c; while(!isdigit(c=getchar())) if(c=='-') k=-k;
    while(isdigit(c)) r=r*10+c-'0', c=getchar(); return r*k;
}
const int N=1e6+10;
ll t, n;
struct seq{
    ll len, minval, minnum, maxval, maxnum;
}s[N];

seq merge(seq x, seq y){
    seq res;
    res.len=x.len+y.len;
    if(x.minval<y.minval) res.minval=x.minval, res.minnum=x.minnum;
    else if(x.minval==y.minval) res.minval=x.minval, res.minnum=x.minnum+y.minnum;
    else res.minval=y.minval, res.minnum=y.minnum;
    if(x.maxval>y.maxval) res.maxval=x.maxval, res.maxnum=x.maxnum;
    else if(x.maxval==y.maxval) res.maxval=x.maxval, res.maxnum=x.maxnum+y.maxnum;
    else res.maxval=y.maxval, res.maxnum=y.maxnum;
    return res;
}

int main(){
    t=rd();
    while(t--){
        n=rd();
        REP(i, 1, n){
            int op=rd();
            if(op==1){
                s[i]=(seq){0, LLONG_MAX/2, 0, LLONG_MIN/2, 0};
                int k=rd();
                REP(j, 1, k){
                    ll tmp=rd();
                    s[i]=merge(s[i], (seq){1, tmp, 1, tmp, 1});
                }
            }else{
                int x=rd(), y=rd();
                s[i]=merge(s[x], s[y]);
            }
        }
        ll len=s[n].len, mxnum=max(s[n].minnum, s[n].maxnum);
        ll ans=min(len, 2*(len-mxnum));
        printf("%lld\n", ans);
    }
    return 0;
}