#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; }


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) {
  bool hasA = false;
  for (const auto &mu : mus) {
    const int m = mu.first;
    const int u = mu.second;
    if (isLeaf(m, u)) {
      return true;
    }
    if (isLeaf(m, L[m][u]) && isLeaf(m, R[m][u])) {
      hasA = true;
    }
  }
  if (!hasA) {
    return false;
  }
  vector<pair<int, int>> musL, musR;
  for (const auto &mu : mus) {
    const int m = mu.first;
    const int u = mu.second;
    if (~L[m][u] && !~R[m][u]) musL.emplace_back(m, L[m][u]);
    if (!~L[m][u] && ~R[m][u]) musR.emplace_back(m, R[m][u]);
  }
  if (!solve(musL)) return false;
  if (!solve(musR)) 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];
      }
    }
    
    int sumN = 0;
    for (int m = 0; m < M; ++m) {
      sumN += N[m];
    }
    bool spe4 = true;
    for (int m = 0; m < M; ++m) {
      vector<int> us;
      for (int u = 0; u < N[m]; ++u) if (isLeaf(m, u)) {
        us.push_back(u);
      }
      spe4 = spe4 && (us.size() <= 2);
      if (us.size() == 2) {
        bool ok = true;
        for (int u = 0; u < N[m]; ++u) {
          ok = ok || (L[m][u] == us[0] && R[m][u] == us[1]);
          ok = ok || (L[m][u] == us[1] && R[m][u] == us[0]);
        }
        spe4 = spe4 && ok;
      }
    }
cerr<<"M = "<<M<<", sumN = "<<sumN<<", spe4 = "<<spe4<<endl;
    
    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;
}