#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int t;
	cin >> t;
	while (t --> 0) {
		int n;
		cin >> n;
		string a, b;
		cin >> a >> b;
		vector<vector<int>> g(n);
		REP(i,n-1) {
			int c, d;
			cin >> c >> d;
			--c;
			--d;
			g[c].emplace_back(d);
			g[d].emplace_back(c);
		}
		if (a == b) {
			cout << "TAK\n";
			continue;
		}
		bool deg = false;
		REP(i,n) {
			if (ssize(g[i]) >= 3) {
				deg = true;
			}
		}
		set<char> sa, sb;
		REP(i,n) {
			sa.emplace(a.at(i));
			sb.emplace(b.at(i));
		}
		if (ssize(sb) > ssize(sa) || sa.find(*sb.begin()) == sa.end()) {
			cout << "NIE\n";
			continue;
		}
		if (deg) {
			bool kol = false;
			REP(i,n) {
				if (ssize(g[i]) < 3) {
					//continue;
				}
				for (auto xd : g[i]) {
					if (b.at(xd) == b.at(i)) {
						kol = true;
					}
				}
			}
			if (kol) {
				cout << "TAK\n";
				continue;
			}
			cout << "NIE\n";
			continue;
		}
		int ca = 0, cb = 0;
		function<int(int,int)> dfsa = [&](int w, int p) {
			int ans = 0;
			ans += a.at(w) != a.at(p);
			for (auto xd : g[w]) {
				if (xd != p) {
					ans += dfsa(xd, w);
				}
			}
			return ans;
		};
		function<int(int,int)> dfsb = [&](int w, int p) {
			int ans = 0;
			ans += b.at(w) != b.at(p);
			for (auto xd : g[w]) {
				if (xd != p) {
					ans += dfsb(xd, w);
				}
			}
			return ans;
		};
		int root = 0;
		REP(i,n) {
			if (ssize(g[i]) == 1) {
				root = i;
			}
		}
		ca = dfsa(root, root);
		cb = dfsb(root, root);
		debug(ca, cb);
		if (a.at(root) == b.at(root) && ca >= cb) {
			cout << "TAK\n";
			continue;
		}
		if (a.at(root) != b.at(root) && ca > cb) {
			cout << "TAK\n";
			continue;
		}
		cout << "NIE\n";
	}
}