#include<bits/stdc++.h>
using namespace std;
const int N=2e6+99;
int n,m,ln[N],rn[N];
int ptn,vis[10];
void dfs(int u,int id){
	if(id<=3) ptn|=(1<<(id-1));
	else return;
	if(ln[u]) dfs(ln[u],id<<1);
	if(rn[u]) dfs(rn[u],id<<1|1);
}
void solve(){
	memset(vis,0,sizeof(vis));
	cin>>m;
	while(m--){
		cin>>n;
		for(int i=1;i<=n;i++)
			cin>>ln[i]>>rn[i];
		ptn=0; dfs(1,1); vis[ptn]=1;
	}
	if(vis[1]){
		cout<<"Almost Complete"<<'\n';
		return;
	}
	if(vis[3]&&vis[5]&&vis[7]){
		cout<<"Almost Complete"<<'\n';
		return;
	}
	cout<<"No"<<'\n';
	return;
}
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	int T; cin>>T;
	while(T--) solve();
	return 0;
}