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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, a, b;
char s1[1000007], s2[1000007];

struct drzewo
{
    vector <int> l;
    bool color;
};
drzewo tab[1000007];

pair <int, int> rozne_krawedzie(int nr, int o)
{
    int r1 = 0, r2 = 0;
    for(auto el : tab[nr].l)
        if(el != o)
        {
            auto p = rozne_krawedzie(el, nr);
            if(s1[el-1] != s1[nr-1])
                r1++;
            if(s2[el-1] != s2[nr-1])
                r2++;
            r1 += p.ff;
            r2 += p.ss;
        }
    return MP(r1, r2);
}

int solve()
{
    scanf("%d", &n);
    scanf("%s %s", s1, s2);

    FOR(i, 1, n)
        tab[i].l.clear();
    forr(i, n-1)
    {
        scanf("%d %d", &a, &b);
        tab[a].l.PB(b);
        tab[b].l.PB(a);
    }

    bool ok = 1, b1[] = {0, 0}, b2[] = {0, 0};
    forr(i, n)
    {
        b1[s1[i]-'0'] = 1;
        b2[s2[i]-'0'] = 1;
        if(s1[i] != s2[i])
            ok = 0;
    }

    // identyczne
    if(ok)
        return 1;

    // nie ma potrzebnego koloru
    if((b2[0] && !b1[0]) || (b2[1] && !b1[1]))
        return 0;

    auto rozne = rozne_krawedzie(1, -1);

    // wynikowy dwudzielny
    if(rozne.ss == n-1)
        return 0;

    int lisc = -1, deg = 0;
    FOR(i, 1, n)
    {
        deg = max(deg, (int)tab[i].l.size());
        if(tab[i].l.size() == 1)
            lisc = i;
    }

    // prosta
    if(deg <= 2)
    {
        if(rozne.ss > rozne.ff)
            return 0;
        if(rozne.ss == rozne.ff && s1[lisc-1] != s2[lisc-1])
            return 0;
    }

    return 1;
}

int main()
{
    testy()
        printf("%s\n", solve() ? "TAK" : "NIE");

    return 0;
}