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

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << (x))
#define sz(x) (int)x.size()
#define fout(x) {cout << x << "\n"; return; }

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
const int MAXN = 1e5;
const int M = pw(16);
const long long mod = 998244353;
const int N = 1e6 + 200;
//const int N = 100;
const int inf = 1e9;
template <typename T> void vout(T s){cout << s << endl;exit(0);}

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;


void solve(){
    int n;
    cin >> n;

    string a, b;
    cin >> a >> b;
    
    vector <vector <int>> v(n);
    for(int i = 1; i < n; i++){
        int l, r;
        cin >> l >> r;
        l--, r--;
        v[l].p_b(r);        
        v[r].p_b(l);
    }

    map <string, bool> mp;

    queue <string> q;

    mp[a] = 1;
    q.push(a);

    while(!q.empty()){
        string xe = q.front(), xx;
        q.pop();        
        for(int i = 0; i < n; i++){
            for(auto j : v[i]){
                xx = xe;
                xx[j] = xx[i];
                if(mp.find(xx) == mp.end()){
                    mp[xx] = 1;
                    q.push(xx);
                }
            }
        }
    }

    if(!mp[b]){
        cout << "NIE\n";
    }else{
        cout << "TAK\n";
    }
}


int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;

    while(t--) {
        solve();
    }

    

    return 0;
}