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

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<ld, ld> PLD;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VII> VVII;
typedef vector<PLL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<bool> VB;
typedef map<int, int> MII;
typedef unordered_map<int, int> UMII;
typedef map<ll, ll> MLL;
typedef unordered_map<ll, ll> UMLL;

template <class T, class G>
ostream &operator<<(ostream &os, const pair<T, G> &para) {
  os << para.first << " " << para.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  for (const T &el : vec)
    os << el << " ";
  return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &vec) {
  for (const T &el : vec)
    os << el << " ";
  return os;
}

#define REP(i, j) for (int i = 0; i < j; i++)
#define REP1(i, j) for (int i = 1; i < j; i++)
#define FOREACH(el, n) for (auto &el : n)
#define LAST(x) (x[(int)x.size() - 1])
#define pb push_back
#define pf push_front
#define st first
#define nd second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define get_unique(x) x.erase(unique(all(x)), x.end());
#define sp ' '
#define ent '\n'

VVI g;
string jest, gol;

pair<PII, PII> dfs(int x, int p) {
  PII mam = {1, jest[x - 1]};
  PII chce = {1, gol[x - 1]};
  FOREACH(el, g[x]) {
    if (el != p) {
      auto v = dfs(el, x);
      if (mam.st < v.st.st) {
        mam = v.st;
        if (jest[x - 1] != v.st.nd) {
          mam.st += 1;
          mam.nd = jest[x - 1];
        }
      } else if (mam.st == v.st.st) {
        if (jest[x - 1] != v.st.nd) {
          mam.st += 1;
        }
      }
      if (chce.st < v.nd.st) {
        chce = v.nd;
        if (gol[x - 1] != v.nd.nd) {
          chce.st += 1;
          chce.nd = gol[x - 1];
        }
      } else if (chce.st == v.nd.st) {
        if (gol[x - 1] != v.nd.nd) {
          chce.st += 1;
        }
      }
    }
  }
  return {mam, chce};
}

void TEST(int testcase_i) {
  // TESTCASE
  int n;
  cin >> n;
  cin >> jest >> gol;
  g.resize(n + 2);
  REP(i, n - 1) {
    int a, b;
    cin >> a >> b;
    g[b].pb(a);
    g[a].pb(b);
  }
  auto ans = dfs(1, -1);
  if (ans.st.st < ans.nd.st) {
    cout << "NIE" << ent;
  } else if (ans.st.st == ans.nd.st && ans.st.nd != ans.nd.nd) {
    cout << "NIE" << ent;
  } else {
    cout << "TAK" << ent;
  }
  g.clear();
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  int t = 1;
  cin >> t;
  REP(i, t) { TEST(i); }

  return 0;
}