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
157
158
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n)    fwd(i, 0, n)
#define all(X)       X.begin(), X.end()
#define sz(X)        int(size(X))
#define pb           push_back
#define eb           emplace_back
#define st           first
#define nd           second
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) {
	*(int *)0 = 0;
});
#	define DTP(x, y)                                      \
		auto operator<<(auto &o, auto a)->decltype(y, o) { \
			o << "(";                                      \
			x;                                             \
			return o << ")";                               \
		}
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) {
	((cerr << x << ", "), ...) << '\n';
}
#	define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#	define deb(...) 0
#endif

struct ColorNode {
	int color;
	int color_repr;
	int node_count;
};

struct CliqueNode {
	map<int, int> color_repr; // repr for each color
	int clique_repr;
};

int find_color_repr(int node, vector<ColorNode> &color_nodes) {
	return color_nodes[node].color_repr == node
			   ? node
			   : color_nodes[node].color_repr =
					 find_color_repr(color_nodes[node].color_repr, color_nodes);
}

int find_clique_repr(int node, vector<CliqueNode> &clique_nodes) {
	return clique_nodes[node].clique_repr == node
			   ? node
			   : clique_nodes[node].clique_repr = find_clique_repr(
					 clique_nodes[node].clique_repr, clique_nodes);
}

void sol() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<ColorNode> color_nodes(n);
	vector<vi> nodes_of_color(k);
	rep(i, n) {
		cin >> color_nodes[i].color;
		color_nodes[i].color--;
		color_nodes[i].color_repr = i;
		color_nodes[i].node_count = 1;
		nodes_of_color[color_nodes[i].color].pb(i);
	}
	vi erasable_colors;
	rep(i, k) {
		if (sz(nodes_of_color[i]) == 1)
			erasable_colors.pb(i);
	}
	auto join_color_nodes = [&](int repr_a, int repr_b) {
		repr_a = find_color_repr(repr_a, color_nodes);
		repr_b = find_color_repr(repr_b, color_nodes);
		if (repr_a == repr_b)
			return;
		if (color_nodes[repr_a].node_count < color_nodes[repr_b].node_count)
			swap(repr_a, repr_b);
		color_nodes[repr_b].color_repr = repr_a;
		color_nodes[repr_a].node_count += color_nodes[repr_b].node_count;
		if (color_nodes[repr_a].node_count ==
			int(nodes_of_color[color_nodes[repr_a].color].size()))
			erasable_colors.pb(color_nodes[repr_a].color);
	};
	vector<CliqueNode> clique_nodes(m);
	auto join_clique_nodes = [&](int repr_a, int repr_b) {
		repr_a = find_clique_repr(repr_a, clique_nodes);
		repr_b = find_clique_repr(repr_b, clique_nodes);
		if (repr_a == repr_b)
			return;
		if (sz(clique_nodes[repr_a].color_repr) <
			sz(clique_nodes[repr_b].color_repr))
			swap(repr_a, repr_b);
		clique_nodes[repr_b].clique_repr = repr_a;
		for (auto &[color, node] : clique_nodes[repr_b].color_repr) {
			auto it = clique_nodes[repr_a].color_repr.find(color);
			if (it != clique_nodes[repr_a].color_repr.end()) {
				join_color_nodes(node, it->nd);
			} else {
				clique_nodes[repr_a].color_repr[color] = node;
			}
		}
		clique_nodes[repr_b].color_repr.clear();
	};
	vector<vi> adjacent_clique_nodes(n);
	rep(i, m) {
		int v, u;
		cin >> v >> u;
		v--;
		u--;
		adjacent_clique_nodes[v].pb(i);
		adjacent_clique_nodes[u].pb(i);
		clique_nodes[i].clique_repr = i;
		clique_nodes[i].color_repr[color_nodes[v].color] = v;
		clique_nodes[i].color_repr[color_nodes[u].color] = u;
		if (color_nodes[v].color == color_nodes[u].color)
			join_color_nodes(v, u);
	}
	int erased_nodes = 0;
	while (!erasable_colors.empty()) {
		int c = erasable_colors.back();
		erased_nodes += sz(nodes_of_color[c]);
		erasable_colors.pop_back();
		int clique_node_repr = -1;
		for (int node : nodes_of_color[c]) {
			for (int clique_node : adjacent_clique_nodes[node]) {
				if (clique_node_repr != -1) {
					join_clique_nodes(clique_node_repr, clique_node);
				}
				clique_node_repr = clique_node;
			}
		}
	}
	if (erased_nodes == n)
		cout << "TAK\n";
	else
		cout << "NIE\n";
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin >> t;
	rep(i, t) sol();
#ifdef LOCF
	cout.flush();
	cerr << "- - - - - - - - -\n";
	(void)!system(
		"grep VmPeak /proc/$PPID/status | sed s/....kB/\' MB\'/1 >&2"); // 4x.kB
																		// ....kB
#endif
	return 0;
}