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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=101000;

int n;
PII E[N];
VI e[N];
char s[N],t[N];
bool solve() {
	scanf("%d",&n);
	scanf("%s",s+1);
	scanf("%s",t+1);
	rep(i,1,n+1) e[i].clear();
	rep(i,1,n) {
		int u,v;
		scanf("%d%d",&u,&v);
		e[u].pb(v);
		e[v].pb(u);
		E[i]=mp(u,v);
	}
	bool sm=1;
	rep(i,1,n+1) sm&=s[i]==t[i];
	if (sm) return 1;
	bool bip=1;
	rep(i,1,n) bip&=t[E[i].fi]!=t[E[i].se];
	if (bip) return 0;
	bool ac=1;
	rep(i,1,n+1) ac&=s[i]==s[1];
	if (ac) return 0;
	VI leaf;
	rep(i,1,n+1) if (SZ(e[i])==1) leaf.pb(i);
	if (SZ(leaf)==2) {
		int ps=0,pt=0;
		rep(i,1,n) ps+=s[E[i].fi]!=s[E[i].se];
		rep(i,1,n) pt+=t[E[i].fi]!=t[E[i].se];
		return (ps>pt||(ps==pt&&s[leaf[0]]==t[leaf[0]]&&s[leaf[1]]==t[leaf[1]]));
	}
	return 1;
}

int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		puts(solve()?"TAK":"NIE");
	}
}