1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<unordered_set>

using namespace std;

// class FindUnion {

//   vector<int> parent;
//   vector<int> size;
// public:
//   FindUnion(int n) {
//     parent.resize(n);
//     size.resize(n);
//     for(int i = 0; i < n; i++) {
//       make_set(i);
//     }
//   }

//   void make_set(int v) {
//     parent[v] = v;
//     size[v] = 1;
//   }

//   void union_sets(int a, int b) {
//       a = find_set(a);
//       b = find_set(b);
//       if (a != b) {
//           if (size[a] < size[b])
//               swap(a, b);
//           parent[b] = a;
//           size[a] += size[b];
//       }
//   }

//   int find_set(int v) {
//     if (v == parent[v])
//         return v;
//     return parent[v] = find_set(parent[v]);
//   }

//   bool is_same_set(int a, int b) {
//     return find_set(a) == find_set(b);
//   }
// };

void dfs(int node, const vector<vector<int>>& graph, const vector<int>& node_color, vector<bool>& visited) {
  visited[node] = true;
  for(int u : graph[node]) {
    if(!visited[u] && node_color[u] == node_color[node]) {
      dfs(u, graph, node_color, visited);
    }
  }
}

void dfs2(int node, int color, const vector<vector<int>>& graph, const vector<int>& node_color, vector<bool>& visited) {
  visited[node] = true;
  for(int u : graph[node]) {
    if(!visited[u] && (node_color[u] == 0 || node_color[u] == color)) {
      dfs2(u, color, graph, node_color, visited);
    }
  }
}

bool cmp(int a, int b) {
  return a > b;
}

void solve() {
  int n,m,k;
  cin >> n>>m>>k;
  //cout << "n: " << n << " m: " << m << " k: " << k << endl;
  vector<int> node_color(n+1);
  vector<vector<int>> color_to_node(n+1);
  for(int i = 1; i <= n; i++) {
    cin >> node_color[i];
    color_to_node[node_color[i]].push_back(i);
  }
  vector<vector<int>> graph(n+1);
  for(int i = 0; i < m; i++) {
    int a,b;
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }

  vector<int> color_components_number(k+1, 0);
  vector<bool> visited(n+1, false);
  //FindUnion components(n);
  for(int i = 1; i <= n; i++) {
    if(!visited[i]) {
      color_components_number[node_color[i]]++;
      dfs(i, graph, node_color, visited);
    }
  }

  // for(int i = 1; i <= k; i++) {
  //   cout << "color: " << i << " components: " << color_components_number[i] << endl;
  // }

  queue<int> top_colors;
  unordered_set<int> remaining_colors;
  for(int i = 1; i <= k; i++) {
    if(color_components_number[i] == 0) {
      continue;
    }
    remaining_colors.insert(i);
    if(color_components_number[i] == 1) {
      top_colors.push(i);
    }
  }

  while(!top_colors.empty()) {
    int color = top_colors.front();
    //cout << "color: " << color << endl;
    top_colors.pop();
    color_components_number[color] = 0;
    remaining_colors.erase(color);
    for(int node : color_to_node[color]) {
      node_color[node] = 0;
    }
    if(top_colors.empty() && !remaining_colors.empty()) {
      for(auto color : remaining_colors) {
        //cout << "color2: " << color << endl;
        int component_number = 0;
        vector<bool> visited(n+1, false);
        for(auto node : color_to_node[color]) {
          if(!visited[node]) {
            component_number++;
            dfs2(node, color, graph, node_color, visited);
          }
        }
        //cout << "component_number: " << component_number << endl;
        if(component_number == 1) {
          top_colors.push(color);
          break;
        }
      }
    }
  }

  cout << (remaining_colors.empty() ? "TAK" : "NIE") << endl;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int t;
  cin >> t;
  while(t--) {
    solve();
  }
}