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
#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 << '}';
}
ostream& operator<<(ostream &o, string &s) {
    return o << s.data();   
}
#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 q;
    cin >> q;
    while (q--) {
        int n, x, y;
        string s1, s2;
        cin >> n >> s1 >> s2;
        vector<vector<int> > v(n);
        REP(i, n - 1) {
            cin >> x >> y;
            v[--x].emplace_back(--y);
            v[y].emplace_back(x);
        }

        if (s1 == s2) {
            cout << "TAK\n";
            continue;
        }

        bool anyc = false;
        FOR(i, 1, n - 1) {
            if (s1[i] != s1[i - 1])
                anyc = true;
        }
        if (!anyc) {
            cout << "NIE\n";
            continue;
        }

        bool line = true;
        REP(i, n) {
            if (ssize(v[i]) >= 3) {
                line = false;
                break;
            }
        }

        if (line) {
            vector<int> ord;
            
            function<void(int, int)> find_order = [&](int x, int fat) {
                ord.emplace_back(x);
                for (auto it : v[x]) {
                    if (it != fat)
                        find_order(it, x);
                }
            };

            REP(i, n) {
                if (ssize(v[i]) == 1) {
                    find_order(i, i);
                    break;
                }
            }

            int changes = 0;
            FOR(i, 1, n - 1) {
                if (s2[ord[i]] != s2[ord[i - 1]])
                    changes++;
            }
            bool fst = false;
            REP(i, n) {
                if (!fst) {
                    if (s1[ord[i]] == s2[ord[0]]) {
                        fst = true;
                    }
                }
                else {
                    if (s1[ord[i]] != s1[ord[i - 1]])
                        changes--;
                }
            }

            cout << (changes <= 0 ? "TAK\n" : "NIE\n");
            continue;
        }

        bool win = false;

        REP(i, n) {
            for (auto it : v[i]) {
                if (s2[i] == s2[it])
                    win = true;
            }
        }
        cout << (win ? "TAK\n" : "NIE\n");
    }

    return 0;
}