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
#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")

#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)

using namespace std;

///~~~~~~~~~~~~~~~~~~~~~~~~~~

void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);

///~~~~~~~~~~~~~~~~~~~~~~~~~

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N=2e5+5, INF=1e9+5, mod=1e9+7;

int main(){
	BOOST;
	int T;
	cin>>T;
	while(T--){
		int n;
		cin>>n;
		str s, t;
		cin>>s>>t;
		bool czy=1;
		int k1=0, k2=0;
		for(int i=0; i<n; i++){
			if(s[i]!=s[0])k1=1;
			if(t[i]!=t[0])k2=1;
		}
		vi deg(n+1);
		int a=0, b=0;
		for(int i=1; i<n; i++){
			int u, v;
			cin>>u>>v;
			deg[u]++;
			deg[v]++;
			if(s[u-1]!=s[v-1])a++;
			if(t[u-1]!=t[v-1])b++;
		}
		if(!k2 && (k1 || s[0]==t[0])){
			cout<<"TAK\n";
			continue;
		}
		if(!k1){
			cout<<"NIE\n";
			continue;
		}
		//cout<<"a";
		int l=0;
		for(int i=1; i<=n; i++){
			if(deg[i]==1)l=i;
			if(deg[i]>2)czy=0;
		}
		if(czy && ((a-(t[l-1]!=s[l-1]))<b)){
			cout<<"NIE\n";
			continue;
		}
		//cout<<"a";
		if(s!=t && b==n-1)cout<<"NIE\n";
		else cout<<"TAK\n";
	}
}