#include <bits/stdc++.h>
#define il inline
#define pii pair<int,int>
#define fi first
#define se second
#define YES {puts("Almost Complete");continue;}
#define NO {puts("No");continue;}
using namespace std;
il int read(){
    int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-48,c=getchar();
    return x;
}
const int N=1e5+5;
int T,n,ck;
struct node{
    int n;vector<pii> s;
    il node(){n=0,s.clear();}
    il int get(int x){return (s[x].fi>0)+2*(s[x].se>0);}
    il void Read(){
        n=read(),s.resize(n+1);
        for(int i=1;i<=n;++i) s[i].fi=read(),s[i].se=read();
    }
    il int ck(int x){
        int y=s[x].fi,z=s[x].se;
        if(y && !ck(y)) return 0;
        if(z && !ck(z)) return 0;
        if(get(y) && get(z)) return 0;
        return 1;
    }
}a[N],cur;
int dfs(vector<pii> f){
    if(!f.size()) return 0;
    vector<pii> b,c,d,e;int x,y,z,u,v,w;
    //puts("0 start:");
    //for(auto it:f) printf("%d %d\n",it.fi,it.se);
    for(auto it:f){
        x=a[it.fi].get(it.se),y=a[it.fi].s[it.se].fi,z=a[it.fi].s[it.se].se;
        if(!x) return 1;
        if(x==1) b.push_back({it.fi,y});
        if(x==2) c.push_back({it.fi,z});
        if(x==3){
           // if(){puts("*");while(1);}
            if(!a[it.fi].get(y)) d.push_back({it.fi,z});
            if(!a[it.fi].get(z)) e.push_back({it.fi,y});
        }
    }
    /*puts("1*");
    for(auto it:b) printf("%d %d\n",it.fi,it.se);
    puts("2**");
    for(auto it:c) printf("%d %d\n",it.fi,it.se);
    puts("3***");
    for(auto it:d) printf("%d %d\n",it.fi,it.se);
    puts("4****");
    for(auto it:e) printf("%d %d\n",it.fi,it.se);*/
    int bb=dfs(b),cc=dfs(c),dd=dfs(d),ee=dfs(e);
    //printf("return value b c d e : %d %d %d %d\n",bb,cc,dd,ee);
    return bb&cc&dd&ee;
}
vector<pii> f;
int x,y,z,u,v,w;
int main(){
    //freopen("ex_surreal6.in","r",stdin);
    //freopen("ex_surreal5.out","w",stdout);
    scanf("%d",&T);
    while(T--){
        scanf("%d",&x);n=0,ck=0;
        for(int i=1;i<=x;++i){
            cur.Read(),ck|=(cur.n==1);
            if(cur.ck(1)) a[++n]=cur;
        }if(ck) YES
        //puts("---------------------------------");
        f.resize(n);for(int i=1;i<=n;++i) f[i-1]={i,1};
        if(dfs(f)) YES
        else NO
    }





    return 0;
}