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
#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 << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

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

    int t;
    cin >> t;

    REP(_t, t) {
        int n;
        cin >> n;

        string a, b;
        cin >> a >> b;

        vector<vector<int>> adj(n);
        REP(i, n - 1) {
            int x, y;
            cin >> x >> y;
            adj[x - 1].emplace_back(y - 1);
            adj[y - 1].emplace_back(x - 1);
        }

        vector<bool> able(1 << n);

        function<void(int)> dfs = [&](int state) {
            debug(state);
            able[state] = true;
            REP(i, n) {
                int x = (state >> i) & 1;      
                bool found = false;
                for(int j : adj[i]) {
                    int y = (state >> j) & 1;
                    if(x != y) {
                        found = true;
                        break;
                    }
                }

                if(found && !able[state ^ (1 << i)])
                    dfs(state ^ (1 << i));
            }
        };

        auto get_state = [&](string &s) {
            int res = 0;
            REP(i, n) 
                res += (1 << i) * (s[i] == '1');
            return res;
        };

        dfs(get_state(a));

        cout << (able[get_state(b)] ? "TAK" : "NIE") << "\n";
    }
}