#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int read(){
	int x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')ch=getchar();
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x;
}
int t,m,n[2000005];
int l[2000005],r[2000005];
bool dfs(vector<int> c){
	int n=c.size();
	if (n==0)return 0;
	for (int i=0;i<n;i++)
		if (l[c[i]]==0&&r[c[i]]==0)return 1;
	vector<int> dl,dr;
	for (int i=0;i<n;i++){
		if (l[c[i]]!=0&&r[c[i]]==0)dl.push_back(l[c[i]]);
		if (l[c[i]]==0&&r[c[i]]!=0)dr.push_back(r[c[i]]);
	}
	if (!dfs(dl))return 0;
	if (!dfs(dr))return 0;
	dl.clear(),dr.clear();
	for (int i=0;i<n;i++){
		if (l[c[i]]!=0&&r[c[i]]!=0){
			int ls=l[c[i]],rs=r[c[i]];
			if (l[rs]==0&&r[rs]==0&&ls!=0)dl.push_back(ls);
			if (l[ls]==0&&r[ls]==0&&rs!=0)dr.push_back(rs);
		}
	}
	if (!dfs(dl))return 0;
	if (!dfs(dr))return 0;
	return 1;
}
int main(){
	t=read();
	while(t--){
		m=read();
		vector<int> c;
		for (int i=1;i<=m;i++){
			n[i]=read();
			for (int j=1;j<=n[i];j++){
				l[n[i-1]+j]=read(),r[n[i-1]+j]=read();
				if (l[n[i-1]+j]!=0)l[n[i-1]+j]+=n[i-1];
				if (r[n[i-1]+j]!=0)r[n[i-1]+j]+=n[i-1];
			}
			c.push_back(n[i-1]+1);
			n[i]+=n[i-1];
		}
		if (dfs(c))puts("Almost Complete");
		else puts("No");
		for (int i=0;i<=n[m];i++)l[i]=r[i]=0;
	}
	return 0;
}