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
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//~ while (clock()<=69*CLOCKS_PER_SEC)

#define ll long long
#define ld long double
#define pi pair<int,int>
#define pd pair<ld,ld>
#define ft first
#define sd second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define FOR(i,a,b) for(int i=(a); i<=(b);i++)
#define F(i,a,b) FOR(i,(a),(b)-1)
#define REV(i,a,b) for(int i=(a); i>=(b);i--)
#define VI vector<int>
#define VPI vector<pi>
#define VPD vector<pd>
#define PI 3.14159265
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)((a).size())
#define int long long

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
	while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long K = 1000;
const long long KK = K*K;
const long long MIL = KK*K;
const long long INF = MIL*MIL;
const long long MOD = 1e9 + 7;
const long long N = 1e5 + 10, M=10;

VI G[N];
string act, doc;
bool res = true;
int start;

bool podciag(VI a, VI b) {
	int id = 0;
	for (int i : a) {
		if (id < sz(b) && b[id] == i) {
			id++;
		}
	}

	return id == sz(b);
}

bool jest_duplikat(int x, int par) {
	if (sz(G[x]) == 2) {
		int inne = G[x][0] == par ? G[x][1] : G[x][0];
		if (doc[inne - 1] == doc[x - 1]) {
			return true;
		} else {
			return jest_duplikat(inne, x);
		}
	}

	return false;
}

pair<VI, VI> dfs(int x, int par) {
	if (sz(G[x]) == 1 && x != start) {
		return {{act[x - 1]}, {doc[x - 1]}};
	}

	if (sz(G[x]) == 2 || x == start) {
		int gdzie = G[x][0] == par ? G[x][1] : G[x][0];
		auto tmp = dfs(gdzie, x);
		if (!sz(tmp.ft) || tmp.ft.back() != act[x - 1])
			tmp.ft.eb(act[x - 1]);
		if (!sz(tmp.sd) || tmp.sd.back() != doc[x - 1])
			tmp.sd.eb(doc[x - 1]);

		return tmp;
	}

	return {{}, {}};
}

void solve() {
	int n;
	cin >> n;
	cin >> act >> doc;

	FOR(i, 1, n) {
		G[i].clear();
	}

	F(i, 0, n - 1) {
		int a, b;
		cin >> a >> b;
		G[a].eb(b);
		G[b].eb(a);
	}

	if (act == doc)  {
		cout << "TAK\n";
		return;
	}

	bool jedna_act = true;
	bool jedna_doc = true;
	F(i, 0, n) {
		jedna_act &= act[i] == act[0];
		jedna_doc &= doc[i] == doc[0];
	}

	if (jedna_act) {
		cout << "NIE\n";
		return;
	}

	FOR(i, 1, n) {
		if (sz(G[i]) > 2) {
			for (int j : G[i]) {
				if (doc[j - 1] == doc[i - 1]) {
					cout << "TAK\n";
					return;
				}
			}
		}
		if (sz(G[i]) == 1) {
			start = i;
		}
	}

	bool jest3 = false;
	FOR(i, 1, n) {
		if (sz(G[i]) > 2) {
			jest3 = true;
			for (int j : G[i]) {
				if (jest_duplikat(j, i)) {
					cout << "TAK\n";
					return;
				}
			}
		}
	}

	if (jest3) {
		cout << "NIE\n";
		return;
	}

	auto tmp = dfs(start, -1);

	cout << (podciag(tmp.ft, tmp.sd) ? "TAK\n" : "NIE\n");
}

int32_t main()
{
	//	freopen("input.txt", "r", stdin);
	//	freopen("output.txt", "w", stdout);

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cerr.tie(0);
	cout<<setprecision(9)<<fixed;
	cerr<<setprecision(6)<<fixed;
	int test = 1, f;
	cin>>test;
	F(_test, 0, test){
		//cout<<"Case #"<<_test + 1<<": ";
		solve();
		//		if(_test == 1)
		//            return 0;
	}
}
/*
1
5
11001
00100
1 2
2 3
3 4
3 5
 */