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
#include <iostream>
#include <vector>
using namespace std;
int t, n, a, b, k;
string s, w;
vector <int> G[1000001];
int main() {
	ios_base::sync_with_stdio(0);
	cin >> t;
	while (t--) {
		bool g1 = 0, g2 = 0, g3 = 0;
		cin >> n >> s >> w;

		for (int i = 0; i < n - 1; i++) {
			cin >> a >> b;
			G[a+k].push_back(b+k);
			G[b+k].push_back(a+k);
		}
		for (int i = 0; i < n; i++) {
			if (G[i + k + 1].size() > 2) g1 = 1;
			if (i != n - 1 && s[i] != s[i + 1]) g2 = 1;
			if (i != n - 1 && w[i] != w[i + 1]) g3 = 1;
		}

		if ((g1 && g2) || s == w) cout << "TAK\n";
		else if (g2 && !g3 && !g1) cout << "TAK\n";
		else cout << "NIE\n";
		k += n;
	}
}