#include <bits/stdc++.h>

const int N = 1e6 + 50;

int n;
std::string s, t;
std::vector<int> G[N];

bool solve() {
	if (s == t) return true;
	int count = 0;
	for (char ch : s) {
		count |= 1 << (ch - '0');
	}
	if (count != 3) return false;
	bool ok = false;
	for (int x = 0; x < n; ++x) {
		for (int y : G[x]) {
			if (t[x] == t[y])
				ok = true;
		}
	}
	if (!ok) return false;
	for (int i = 0; i < n; ++i) {
		if (G[i].size() >= 3)
			return true;
	}
	int head = -1;
	for (int i = 0; i < n; ++i)
		if (G[i].size() == 1) {
			head = i;
			break;
		}
	std::vector<int> sret, tret;
	int slst = -1, tlst = -1;
	std::function<void(int, int)> dfs = [&](int x, int fa) {
		if (slst != s[x]) {
			if (slst != -1) sret.push_back(slst);
			slst = s[x];
		}
		if (tlst != t[x]) {
			if (tlst != -1) tret.push_back(tlst);
			tlst = t[x];
		}
		for (int y : G[x]) {
			if (y != fa) {
				dfs(y, x);
			}
		}
	};
	dfs(head, -1);
	sret.push_back(slst);
	tret.push_back(tlst);
	if (sret.front() == tret.front()) return sret.size() >= tret.size();
	return sret.size() > tret.size();
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	int T;
	std::cin >> T;
	while (T--) {
		std::cin >> n;
		std::cin >> s >> t;
		for (int i = 1; i < n; ++i) {
			int x, y;
			std::cin >> x >> y;
			--x; --y;
			G[x].push_back(y);
			G[y].push_back(x);
		}
		puts(solve() ? "TAK" : "NIE");
		for (int i = 0; i < n; ++i) G[i].clear();
	}
}