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>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

vector<int>G[100007];
string s,s1;
vector<char>V,V1;

void dfs(int v,int o)
{
    if(s[v]!=s[o]) V.pb(s[v]);
    if(s1[v]!=s1[o]) V1.pb(s1[v]);
    for(auto u:G[v])
    {
        if(u==o) continue;
        dfs(u,v);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tt;
    cin>>tt;
    while(tt--)
    {
        int n;
        cin>>n;
        cin>>s>>s1;
        bool dwudzielny=1;
        for(int i=1;i<=n;i++) G[i].clear();
        s='#'+s;
        s1='#'+s1;
        for(int i=1;i<n;i++)
        {
            int a,b;
            cin>>a>>b;
            if(s1[a]==s1[b]) dwudzielny=0;
            G[a].pb(b);
            G[b].pb(a);
        }
        if(s==s1)
        {
            cout<<"TAK"<<endl;
            continue;
        }
        if(n==1)
        {
            cout<<"NIE"<<endl;
            continue;
        }
        bool b=1,w=1;
        for(int i=1;i<=n;i++)
        {
            if(s[i]=='0') w=0;
            else b=0;
        }
        bool bambus=1;
        for(int i=1;i<=n;i++) if(sz(G[i])>2) bambus=0;
        if(bambus)
        {
            V.clear(),V1.clear();
            for(int i=1;i<=n;i++)
            {
                if(sz(G[i])!=1) continue;
                dfs(i,0);
                break;
            }
            if(sz(V)>sz(V1)) cout<<"TAK"<<endl;
            else if(sz(V)==sz(V1)&&V[0]==V1[0]) cout<<"TAK"<<endl;
            else cout<<"NIE"<<endl;
        }
        else
        {
            if(b||w||dwudzielny) cout<<"NIE"<<endl;
            else cout<<"TAK"<<endl;
        }
    }

    return 0;
}