#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


/*
  e: empty
  T: set of binary trees
  AC(T): only finitely many trees in T cannot be generated)
  
  T = {(e,e)} + T*{e} + {e}*T + T*T
  AC(T) <=> AC(T*{e}) and AC({e}*T) and AC(T*T)
  AC(T*T) <=> AC(T*{(e,e)}) and AC({(e,e)}*T)
    (==>) trivial because T*T \supseteq T*{(e,e)} + {(e,e)}*T
    (<==) (T-L)*{(e,e)}, {(e,e)}*(T-R) can be generated ==> T*T - L*R can be generated
*/

int M;
vector<int> N;
vector<vector<int>> L, R;

bool isLeaf(int m, int u) {
  return (~u && !~L[m][u] && !~R[m][u]);
}

bool solve(const vector<pair<int, int>> &mus) {
  if (mus.empty()) {
    return false;
  }
  vector<pair<int, int>> sub[4];
  for (const auto &mu : mus) {
    const int m = mu.first;
    const int u = mu.second;
    if (isLeaf(m, u)) {
      return true;
    }
    const int l = L[m][u];
    const int r = R[m][u];
    if (~l && !~r) sub[0].emplace_back(m, l);
    if (!~l && ~r) sub[1].emplace_back(m, r);
    if (~l && isLeaf(m, r)) sub[2].emplace_back(m, l);
    if (isLeaf(m, l) && ~r) sub[3].emplace_back(m, r);
  }
  for (int s = 0; s < 4; ++s) {
    if (!solve(sub[s])) {
      return false;
    }
  }
  return true;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &M);
    N.resize(M);
    L.resize(M);
    R.resize(M);
    for (int m = 0; m < M; ++m) {
      scanf("%d", &N[m]);
      L[m].resize(N[m]);
      R[m].resize(N[m]);
      for (int u = 0; u < N[m]; ++u) {
        scanf("%d%d", &L[m][u], &R[m][u]);
        --L[m][u];
        --R[m][u];
      }
    }
    
    vector<pair<int, int>> mrs(M);
    for (int m = 0; m < M; ++m) {
      mrs[m] = make_pair(m, 0);
    }
    const bool ans = solve(mrs);
    puts(ans ? "Almost Complete" : "No");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}