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
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <time.h>
#include <queue>

using namespace std;

typedef struct {
	int party;
	set<int> adj;
} vertex_t;

void test_case() {
	int n, m, k;
	scanf("%d %d %d", &n, &m, &k);
//	printf("%d %d %d\n", n, m, k);
	vertex_t v;
	vector<vertex_t> V(n, v);
	queue<pair<int, int> > to_merge;
	vector<set<int> > party_cities(k + 1, set<int>());
	queue<int> to_delete;
	for (int i = 0; i < n; ++i) {
		scanf("%d", &V[i].party);
//		printf("%d ", V[i].party);
		party_cities[V[i].party].insert(i);
	}
//	printf("\n");
	for (int i = 1; i <= k; ++i) {
		if (party_cities[i].size() == 1) {
			to_delete.push(i);
		}
	}
	for (int i = 0; i < m; ++i) {
		int a, b;
		scanf("%d %d", &a, &b);
//		printf("%d %d\n", a, b);
		a--;
		b--;
		V[a].adj.insert(b);
		V[b].adj.insert(a);
		if (V[a].party == V[b].party) {
			to_merge.push(make_pair(a, b));
		}
	}
	while (true) {
		while (!to_merge.empty()) {
			pair<int, int> item = to_merge.front();
			to_merge.pop();
			int merge_from = item.first;
			int merge_into = item.second;
			if (V[merge_from].adj.find(merge_into) == V[merge_from].adj.end()) {
				continue;
			}
			if (V[merge_from].adj.size() > V[merge_into].adj.size()) {
				int tmp = merge_from;
				merge_from = merge_into;
				merge_into = tmp;
			}
	//		printf("MERGE FROM %d INTO %d\n", merge_from, merge_into);
			V[merge_into].adj.erase(merge_from);
			for (set<int>::iterator it = V[merge_from].adj.begin(); it != V[merge_from].adj.end(); it++) {
				if (*it == merge_into) {
					continue;
				}
				V[*it].adj.erase(merge_from);
				if (V[merge_into].adj.find(*it) == V[merge_into].adj.end()) {
					V[merge_into].adj.insert(*it);
	//				printf("INSERT EDGE %d - %d\n", merge_into, *it);
					V[*it].adj.insert(merge_into);
					if (V[merge_into].party == V[*it].party) {
						to_merge.push(make_pair(merge_into, *it));
					}
				}
			}
			V[merge_from].adj.clear();
			party_cities[V[merge_from].party].erase(merge_from);
			if (party_cities[V[merge_from].party].size() == 1) {
				to_delete.push(V[merge_into].party);
			}
		}
		if (to_delete.empty()) {
			break;
		}
		int party_to_delete = to_delete.front();
		to_delete.pop();
		int delete_node = *party_cities[party_to_delete].begin();
	//	printf("DELETE %d\n", delete_node);
		party_cities[party_to_delete].erase(delete_node);
		if (V[delete_node].adj.empty()) {
			continue;
		}
		map<int, int> counters;
		for (set<int>::iterator it = V[delete_node].adj.begin(); it != V[delete_node].adj.end(); it++) {
			if (counters.find(V[*it].party) == counters.end()) {
				counters[V[*it].party] = 1;
			}
			else {
				counters[V[*it].party]++;
			}
		}
		int max_counter = -1;
		int replace_with = 0;
		for (map<int, int>::iterator it = counters.begin(); it != counters.end(); it++) {
			if (it->second > max_counter) {
				max_counter = it->second;
				replace_with = it->first;
			}
		}
	//	printf("NEW PARTY: %d\n", replace_with);
		V[delete_node].party = replace_with;
		party_cities[replace_with].insert(delete_node);
		for (set<int>::iterator it = V[delete_node].adj.begin(); it != V[delete_node].adj.end(); it++) {
			if (V[*it].party == replace_with) {
				to_merge.push(make_pair(*it, delete_node));
			}
		}
	}
	bool ok = true;
	for (vector<set<int> >::iterator it = party_cities.begin(); it != party_cities.end(); it++) {
		if (!it->empty()) {
			ok = false;
			break;
		}
	}
	printf(ok ? "TAK\n" : "NIE\n");
}

int main () {
	int t;
	scanf("%d", &t);
	for (int i = 0; i < t; ++i) {
//		printf("START CASE %d\n", i + 1);
		test_case();
	}
	return 0;
}