//-DYUNQIAN -std=c++14 -O2 -Wall
#include<bits/stdc++.h>

#define ll long long

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=1e9+7;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}

void Assert(bool c,int L=0){if(!c){cout<<"Assertion Failed at "<<L<<endl;exit(0);}}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

const int N=2e6+5;
int ls[N],rs[N],m,n;
vector<int>vec[N];

int sz[N];
bool check(vector<int>nodes){
	if(nodes.empty())return 0;
	vector<int>A1,A2,B,C;
	for(int x:nodes){
		if(ls[x]==0&&rs[x]==0)return 1;
		if(ls[x]!=0&&rs[x]==0)B.emplace_back(ls[x]);
		if(ls[x]==0&&rs[x]!=0)C.emplace_back(rs[x]);
		if(ls[x]!=0&&rs[x]!=0){
			if(sz[ls[x]]==1)A1.emplace_back(rs[x]);
			if(sz[rs[x]]==1)A2.emplace_back(ls[x]);
		}
	}
	return check(A1)&&check(A2)&&check(B)&&check(C);
}

bool dfs(int x){
	sz[x]=1;bool chk=1;
	if(ls[x])chk&=dfs(ls[x]),sz[x]+=sz[ls[x]];
	if(rs[x])chk&=dfs(rs[x]),sz[x]+=sz[rs[x]];
	chk&=(sz[ls[x]]<=1||sz[rs[x]]<=1);
	return chk;
}

void solve(){
	m=read();
	int tot=0;
	vector<int>tmp,roots;
	for(int i=1;i<=m;i++){
		n=read();tmp.emplace_back(tot+1);
		for(int i=1;i<=n;i++){
			int lc=read(),rc=read();
			if(lc)ls[i+tot]=lc+tot;
			if(rc)rs[i+tot]=rc+tot;
		}
		tot+=n;
	}
	for(int x:tmp)if(dfs(x))roots.emplace_back(x);
	puts(check(roots)?"Almost Complete":"No");
	for(int i=1;i<=tot;i++)ls[i]=rs[i]=sz[i]=0;
}

signed main(void){

#ifdef YUNQIAN
	freopen("surreal.in","r",stdin);
	freopen("surreal.out","w",stdout);
#endif

	int tt=read();
	for(int i=1;i<=tt;i++)solve();

	return 0;
}