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
//Sylwia Sapkowska
#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;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double LD;
 
typedef pair<int, int> pii;
typedef pair<LL,LL> pll;
typedef pair<LD,LD> pdd;
 
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<LD> vld;
typedef vector<LL> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define repd(i,a,b) for (int i = (a); i >= b; i--)
#define sz(x) (int)(x).size()
#define pb push_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define memo(x) memset(x, 0, sizeof(x))
#define debug(x) cerr << x << " "
#define PI 3.14159265359

const int MAX = 1e5+7;
string before, after;
int change;
int czar, czer, czar1, czer1;
vi graf[MAX];

LL losuj(LL a, LL b){ 
	return a+rng()%(b-a+1);
}

void dfs(int v, int pa){
	if (before[v]!=before[pa]){
		if (before[v] == '0') czer++;
		else czar++;
	}
	for (auto x: graf[v]) if (x!=pa) dfs(x, v);
}

void dfs1(int v, int pa){
	if (after[v]!=after[pa]){
		if (after[v] == '0') czer1++;
		else czar1++;
	}
	for (auto x: graf[v]) if (x!=pa) dfs1(x, v);
}

void dfs2(int v, int pa = -1){
	for (auto x: graf[v]) if (x!=pa) dfs(x, v);
	if (before[v]!=after[v]){
		for (auto x: graf[v]){
			if (before[x] == after[v]) {
				before[v] = before[x];
				break;
			}
		}
	}
}

void solve(){
	int n; cin >> n;
	rep(i, 0, n+1) graf[i].clear();
	cin >> before >> after;
	rep(i, 1, n){
		int a, b; cin >> a >> b;
		a--;b--;
		graf[b].pb(a);
		graf[a].pb(b);
	}
	if (after == before){
		cout << "TAK\n";
		return;
	}
	int cnt[2][2] = {{0, 0}, {0, 0}};
	rep(i, 0, n){
		cnt[before[i]-'0'][0]++;
		cnt[after[i]-'0'][1]++;
	}
	if ((!cnt[0][0] && cnt[0][1]) || (!cnt[1][0] && cnt[1][1])){
		cout << "NIE\n";
		return;
	}
	//sciezka
	int cnt1 = 0;
	rep(i, 0, n){
		if (sz(graf[i]) == 1) cnt1++;
	}
	if (cnt1 == 2){
		czar = 0, czer = 0, czar1 = 0, czer1 = 0;
		int p = 0;
		rep(i, 0, n){
			if (sz(graf[i]) == 1) {
				p = i;
				break;
			}
		}
		
		if(before[p] == '1') czar++;
		else czer++;
		if(after[p] == '1')czar1++;
		else czer1++;
		
		dfs(graf[p][0], p);
		dfs1(graf[p][0], p);
		if (before[p] != after[p]){
			if (before[p] == '0') czer--;
			else czar--;
		}
		if (czer >= czer1 && czar >= czar1) cout << "TAK\n";
		else cout << "NIE\n";
		return;
	}
	
	//inne grafy
	bool ok = 0;
	rep(v, 0, n){
		for (auto x: graf[v]){
			if (after[x] == after[v]){
				ok = 1;
				break;
			}
		}
	}
	if (ok) cout << "TAK\n";
	else cout << "NIE\n";
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = 1;
	cin >> t;
	while (t--) solve();
	
	return 0;
}