#include <bits/stdc++.h>

#define check(x) (!ls[x] && !rs[x])

using namespace std;

inline int read() {
	int out = 0; bool flag = false;
	register char cc = getchar();
	while (cc < '0' || cc > '9') {
		if (cc == '-') flag = true;
		cc = getchar();
	}
	while (cc >= '0' && cc <= '9') {
		out = (out << 3) + (out << 1) + (cc ^ 48);
		cc = getchar();	
	}
	return flag ? -out : out;
}

const int N = 2e6 + 10, M = 2e6 + 10;

int T, m, n, ls[N], rs[N], rt, tr[N][4], nodeid; bool vis[N];

bool pd(int u) {
	if (check(ls[u]) && check(rs[u])) return true;
	return (pd(ls[u]) && check(rs[u])) || (pd(rs[u]) && check(ls[u]));	
}

void merge(int &x, int y) {
	if (!x) x = ++nodeid;
	if (check(y)) vis[x] = true;
	else {
		if (!rs[y]) merge(tr[x][0], ls[y]);
		else if (!ls[y]) merge(tr[x][1], rs[y]);
		else {
			if (check(rs[y])) merge(tr[x][2], ls[y]);
			if (check(ls[y])) merge(tr[x][3], rs[y]);
		}
	}
}

bool grow(int u) {
	if (!u) return false;
	if (vis[u]) return true;
	return grow(tr[u][0]) && grow(tr[u][1]) && grow(tr[u][2]) && grow(tr[u][3]);
}

int main() {
	for (T = read(); T; T--) {
		rt = nodeid = 0;
		for (m = read(); m; m--) {
			n = read();
			for (int i = 1; i <= n; i++) ls[i] = read(), rs[i] = read();
			if (pd(1)) merge(rt, 1);
		}
		puts(grow(rt) ? "Almost Complete" : "No");
		for (int i = 1; i <= nodeid; i++) tr[i][0] = tr[i][1] = tr[i][2] = tr[i][3] = 0, vis[i] = false;
	}
	return 0;
}