#include <bits/stdc++.h>

#define fi first
#define se second
#define db double
#define U unsigned
#define P std::pair<int,int>
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 2e6 + 5;

int rt[MAXN];
int ch[MAXN][2];
int sz[MAXN];

inline void dfs(int v){
	sz[v] = 1;
	if(ch[v][0]) dfs(ch[v][0]),sz[v] += sz[ch[v][0]];
	if(ch[v][1]) dfs(ch[v][1]),sz[v] += sz[ch[v][1]];
}

inline bool work(std::vector<int> S){
	if(S.empty()) return 0;
	for(auto x:S){
		if(sz[x] == 1){
			return 1;
		}
	}
	std::vector<int> v1,v2,v3,v4;
	for(auto x:S){
		// DEBUG(x);
		// DEBUG(ch[x][0]);DEBUG(ch[x][1]);
		// exit(0);
		if(!ch[x][1]) v1.pb(ch[x][0]);
		else if(!ch[x][0]) v2.pb(ch[x][1]);
		else{
			if(sz[ch[x][1]]==1) v3.pb(ch[x][0]);
			if(sz[ch[x][0]]==1) v4.pb(ch[x][1]);
		}
	}
	S.clear();
	return work(v1)&work(v2)&work(v3)&work(v4);
}

inline void Solve(){
	int n;scanf("%d",&n);int tot = 0;
	std::vector<int> S;
	FOR(i,1,n){
		int k;scanf("%d",&k);
		rt[i] = 1+tot;
		FOR(i,1,k) scanf("%d%d",&ch[tot+i][0],&ch[tot+i][1]);
		FOR(i,1,k){
			if(ch[tot+i][0]) ch[tot+i][0] += tot;
			if(ch[tot+i][1]) ch[tot+i][1] += tot;
		}
		tot += k;
		dfs(rt[i]);S.pb(rt[i]);
	}
	puts(work(S)?"Almost Complete" : "No");
	FOR(i,1,tot) ch[i][0] = ch[i][1] = sz[i] = rt[i] = 0; 
}

int main(){
//	freopen("A.in","r",stdin);
	int T;scanf("%d",&T);
	while(T--) Solve();
	return 0;
}