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
155
156
157
158
159
160
161
162
163
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;

#ifdef ONLINE_JUDGE
#define whatis(x) ;
#endif
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int t;
    sc(t);
    int it = 0;
    while(t--){
        int n;
        sc(n);
        vi adj[n];
        string s,t;
        getstr(s);
        getstr(t);
        if(++it == 30){
            whatis(s)
            whatis(t)
        }
        FOR(i,1,n){
            int f,s;
            sc(f,s);
            --f,--s;
            adj[f].push_back(s);
            adj[s].push_back(f);
        }
        bool kk = 0;
        bool kk2 = 0;
        int d1;
        FOR(i,0,n){
            if(adj[i].size() > 2){
                kk = 1;
                /* break; */
                /* bool crkk2 = 0; */
                /* FORR(x,adj[i]){ */
                /*     crkk2 |= t[x] == t[i]; */
                /* } */
                /* kk2 |= crkk2; */
            }
            else if(adj[i].size() == 1){
                d1 = i;
            }
            FORR(x,adj[i]){
                kk2 |= t[x] == t[i];
            }
        }
        bool kk3 = 1;
        int sm = 0, tm = 0;
        FORR(i,s)
            /* sm |= i - '0'; */
            sm |= 1 << (i - '0');
        FORR(i,t)
            tm |= 1 << (i - '0');
        /* kk3 &= sm == tm; */
        kk3 &= (sm & tm) == tm; // thx Stan test
        if(!kk3){
            cout << "NIE\n";
            continue;
        }
        /* if(kk || s == t){ */
        if(s == t){
            cout << "TAK\n";
            continue;
        }
        if(kk){
            cout << (kk2 ? "TAK\n" : "NIE\n");
            continue;
        }
        kk = 1;
        int p[n];
        // gotta normalize the str wait xd.
        p[0] = d1;
        int pr = d1;
        int cr = adj[d1][0];
        FOR(i,1,n){
            p[i] = cr;
            int wh = -1;
            FORR(x,adj[cr]){
                if(x == pr)
                    continue;
                wh = x;
            }
            if(i + 1 != n)
                assert(wh != -1);
            pr = cr;
            cr = wh;
        }
        string sp(n, 0), tp(n, 0);
        FOR(i,0,n){
            sp[i] = s[p[i]];
            tp[i] = t[p[i]];
        }
        string s1,s2;
        FOR(i,0,n){
            if(s1.empty() || s1.back() != sp[i])
                s1 += sp[i];
            if(s2.empty() || s2.back() != tp[i])
                s2 += tp[i];
            /* if(sp[i] == tp[i]) */
            /*     continue; */
            /* if(i && tp[i - 1] == tp[i]) */
            /*     continue; */
            /* bool kk2 = 0; */
            /* FOR(x,i+1,n){ */
            /*     if(sp[x] == tp[i]){ */
            /*         kk2 = 1; */
            /*         break; */
            /*     } */
            /*     sp[x] = tp[i]; // eq do = sp[tg] */
            /* } */
            /* if(!kk2){ */
            /*     kk = 0; */
            /*     break; */
            /* } */
            /* sp[i] = tp[i]; */
        }
        /* cout << (kk ? "TAK\n" : "NIE\n"); */
        cout << (s1 == s2 || s1.size() > s2.size() ? "TAK\n" : "NIE\n");
    }
}