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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define e1 first
#define e2 second
#define pb push_back
#define OUT(x) {cout << x << "\n"; exit(0); }
#define TCOUT(x) {cout << x << "\n"; return; }
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define rep(i, l, r) for(int i = (l); i < (r); ++i)
#define boost {ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define sz(x) int(x.size())
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
/*#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
vector <mint> fac, inv;
mint binom(int n, int k) {
	if (n < k || n < 0) return 0;
	return fac[n] * inv[k] * inv[n-k];
}

void prep(int N) {
	fac.resize(N+1, 1); inv.resize(N+1, 1);
	for (int i=1; i<=N; ++i) fac[i] = fac[i-1] * i;
	inv[N] = fac[N].inv();
	for (int i=N-1; i>0; --i) inv[i] = inv[i+1] * (i + 1);
}*/

mt19937_64 rng(time(0));
int random(int l, int r) {
	return uniform_int_distribution<int>(l, r)(rng);
}
#ifdef DEBUG
template<class T> int size(T &&x) {
	return int(x.size());
}
template<class A, class B> ostream& operator<<(ostream &out, const pair<A, B> &p) {
	return out << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &out, T &&x) -> decltype(x.begin(), out) {
	out << '{';
	for(auto it = x.begin(); it != x.end(); ++it)
		out << *it << (it == prev(x.end()) ? "" : ", ");
	return out << '}';
}
void dump() {}
template<class T, class... Args> void dump(T &&x, Args... args) {
	cerr << x << ";  ";
	dump(args...);
}
#endif
#ifdef DEBUG
  struct Nl{~Nl(){cerr << '\n';}};
# define debug(x...) cerr << (strcmp(#x, "") ? #x ":  " : ""), dump(x), Nl(), cerr << ""
#else
# define debug(...) 0 && cerr
#endif
const int maxn = 1000100;
const int inf = 1e9;
typedef vector<pii> vpi;
//Did you REAALLY consider sample tests?

bool brut(vpi &edges, int start, int end) {
	int n = sz(edges) + 1;
	queue<int> q;
	q.push(start);
	
	vi jest(1 << n, 0);
	int all = (1 << n) - 1;
	
	jest[start] = 1;
	while (!q.empty()) {
		int x = q.front();
		if (jest[end]) return true;
		q.pop();
		
		auto transition = [&](int mask, int a, int b) { //transit from a to b
			int newmask = mask;
			if (mask & (1 << a)) newmask |= (1 << b);
			else {
				newmask &= (all - (1 << b));
			}
			if (!jest[newmask]) {
				q.push(newmask);
				jest[newmask] = 1;
			} 
		};
		
		for (auto & [a, b] : edges) {
			transition(x, a, b);
			transition(x, b, a);
		}
	}
	
	return false;
}

int get_mask(string s) {
	int res = 0;
	rep(i, 0, sz(s)) {
		if (s[i] == '1') res += (1 << i);
	}
	return res;
}

bool all_equal(string s) {
	int n = sz(s);
	rep(i, 0, n) {
		if (s[i] != s[0]) return false;
	}
	return true;
}

vi find_path(const vector <vi> &graf, int start) {
	vi res = {start};
	int n = sz(graf);
	while (sz(res) < n) {
		int node = res.back();
		int nast = -1;
		for (auto u : graf[node]) {
			if (sz(res) > 1 && u == res[sz(res)-2]) continue;
			nast = u;
		}
		
		assert(nast != -1);
		res.pb(nast);
	}
	
	return res;
}

vector <char> grab(const vi &vec, const string &s) {
	vector <char> res = {s[vec[0]]};
	rep(i, 1, sz(vec)) {
		if (s[vec[i]] != res.back()) res.push_back(s[vec[i]]);
	}
	return res;
}

bool wzo(vector <vi> &graf, const string &input, const string &output) {
	if (input == output) return true;
	if (all_equal(input)) return false;
	int n = sz(graf);
	
	bool path = true;
	int leaf = -1;
	
	rep(i, 0, n) {
		if (sz(graf[i]) > 2) path = false;
		if (sz(graf[i]) == 1) leaf = i;
	}
	
	if (path) {
		assert(leaf != -1);
		auto vec = find_path(graf, leaf);
		auto init = grab(vec, input);
		auto dest = grab(vec, output);
		
		int length = sz(init);
		if (init[0] != dest[0]) --length;
		return length >= sz(dest);
	}
	else {
		bool any_edge_finishing = false;
		rep(i, 0, n) {
			trav(j, graf[i]) {
				if (output[i] == output[j]) any_edge_finishing = 1;
			}
		}
		return any_edge_finishing;
	}
}

bool TEST = 0;
void solve(int tc) {
	int n;
	cin >> n;
	int start = 0, end = 0;
	string s1, s2;
	cin >> s1 >> s2;
	start = get_mask(s1);
	end = get_mask(s2);
	
	vpi graf(n-1);
	vector <vi> vec(n);
	
	rep(i, 0, n-1) {
		int a, b;
		cin >> a >> b;
		--a; --b;
		graf[i] = {a, b};
		vec[a].pb(b);
		vec[b].pb(a);
	}
	
	bool ans = wzo(vec, s1, s2);
	
	if (TEST) {
		bool model = brut(graf, start, end);
		assert(model == ans);
	}
	if (ans) cout << "TAK\n";
	else cout << "NIE\n";
}

int main() {
	boost;
	int tests;
	cin >> tests;
	FOR(test, 1, tests) {
		solve(test);
	}
}