#include<bits/stdc++.h>
using namespace std;
const int N=2e6+99; 
int m,n,ln[N],rn[N],ed[N];
int ch[N][4],cntnode,rt;
void dfs(int nid,int &rid){
	//输入树上的节点编号，统一编号
	if(!rid) rid=++cntnode,ed[rid]=ch[rid][0]=ch[rid][1]=ch[rid][2]=ch[rid][3]=0;
	if(ed[rid]) return;
	if(!ln[nid]&&!rn[nid]){ ed[rid]=1; return; }
	if(!ln[nid]){ dfs(rn[nid],ch[rid][0]); return; }
	if(!rn[nid]){ dfs(ln[nid],ch[rid][1]); return; }
	if(!(ln[ln[nid]]||rn[ln[nid]])) dfs(rn[nid],ch[rid][2]);
	if(!(ln[rn[nid]]||rn[rn[nid]])) dfs(ln[nid],ch[rid][3]);
	return;
}
bool solve(int id){
	if(!id) return false;
	if(ed[id]) return true;
	return solve(ch[id][0])&&solve(ch[id][1])&&solve(ch[id][2])&&solve(ch[id][3]);
}
void solve(){
	cntnode=rt=0;
	cin>>m;
	while(m--){
		cin>>n;
		for(int i=1;i<=n;i++)
			cin>>ln[i]>>rn[i];
		int bk=0;
		for(int i=1;i<=n;i++)
			if((ln[ln[i]]||rn[ln[i]])&&(ln[rn[i]]||rn[rn[i]])){ bk=1; break; }
		if(bk) continue;
		dfs(1,rt);
	}
	if(solve(1)) cout<<"Almost Complete"<<'\n';
	else cout<<"No"<<'\n';
	return;
}
int main(){
//	freopen("surreal.in","r",stdin);
//	freopen("surreal.out","w",stdout); 
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	int T; cin>>T;
	while(T--) solve();
	return 0;
}