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
#include <bits/stdc++.h>

using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void canhazfast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
    T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
    while (b) {
        T q = a/b; a %= b; swap(a, b);
        x0 -= q*x1; swap(x0, x1);
        y0 -= q*y1; swap(y0, y1);
    }
    x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}

#define N 100032

vi seq;
char a[N], b[N];
vi adj[N];

void dfs(int u, int p = -1)
{
    seq.pb(u);
    for (int v : adj[u]) {
        ctif(v == p);
        dfs(v, u);
    }
}

void solve()
{
    int n, root = -1;
    int cnta = 0, cntb = 0;
    int fa[2] = {}, fb[2] = {};
    size_t dmax = 0;

    cin >> n >> a >> b;
    seq.clear();
    for (int i = 0; i < n; ++i) adj[i].clear();
    for (int i = 1; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        --x;
        --y;
        ++fa[a[x]^a[y]];
        ++fb[b[x]^b[y]];
        adj[x].pb(y);
        adj[y].pb(x);
    }
    for (int i = 0; i < n; ++i) dmax = max(dmax, adj[i].size());
    if (dmax > 2) {
        cout << (strcmp(a, b) == 0 || (fa[1] > 0 && fb[0] > 0) ? "TAK\n" : "NIE\n");
        return;
    }
    for (int i = 0; i < n; ++i) {
        ctif(adj[i].size() > 1);
        root = i;
        break;
    }
    dfs(root);
    for (int i = 1; i < n; ++i) {
        cnta += a[seq[i]]^a[seq[i-1]];
        cntb += b[seq[i]]^b[seq[i-1]];
    }
    if (a[root] != b[root]) ++cntb;
    cout << (cnta >= cntb ? "TAK\n" : "NIE\n");
}

int main()
{
    canhazfast();

    int t;
    cin >> t;
    for (; t; --t) solve();

    return 0;
}