#include <bits/stdc++.h>

using namespace std;
using ll = long long;

namespace Trie {
    constexpr int N = 1e7 + 228;

    int adj[N][4], term[N];
    int S = 1;

    int create() {
        memset(adj[S], 0, sizeof(adj[S]));
        term[S] = 0;
        return S++;
    }

    void clear() {
        S = 1;
        create();
    }

    int go(int x, int k) {
        if (adj[x][k] == 0) {
            adj[x][k] = create();
        }
        return adj[x][k];
    }

    bool dfs(int v) {
        if (v == 0) {
            return false;
        } else if (term[v]) {
            return true;
        }
        return dfs(adj[v][0]) && dfs(adj[v][1]) && dfs(adj[v][2]) && dfs(adj[v][3]);
    }
}

void insert() {
    int n;
    cin >> n;

    vector<array<int, 2>> ch(n + 1);
    vector<bool> leaf(n + 1);
    leaf[0] = true;

    for (int i = 1; i <= n; ++i) {
        cin >> ch[i][0] >> ch[i][1];
        leaf[i] = !ch[i][0] && !ch[i][1];
    }

    auto dfs = [&](auto self, int v, int t) -> void {
        auto [l, r] = ch[v];

        if (l == 0 && r == 0) {
            Trie::term[t] = 1;
        } else if (min(l, r) == 0) {
            self(self, max(l, r), Trie::go(t, l == 0));
        } else {
            if (leaf[l]) {
                self(self, r, Trie::go(t, 3));
            }
            if (leaf[r]) {
                self(self, l, Trie::go(t, 2));
            }
        }
    };

    dfs(dfs, 1, 1);
}

void solve() {
    int m;
    cin >> m;

    Trie::clear();

    for (int i = 0; i < m; ++i) {
        insert();
    }

    if (Trie::dfs(1)) {
        cout << "Almost Complete\n";
    } else {
        cout << "No\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

#ifdef __APPLE__
    freopen("surreal.in", "r", stdin);
    freopen("surreal.out", "w", stdout);
#endif

    int test = 1;
    cin >> test;

    while (test--) {
        solve();
    }

    return 0;
}