//Shirasu Azusa 2024.03
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=1e5+5;
int n,deg[N],cnt[2],a[N],b[N],p[N],m,vst[N];
vi e[N];
char s[N],t[N];

void work(int tc) {
  n=read(); cnt[0]=cnt[1]=0;
  rep(i,1,n) deg[i]=vst[i]=0, e[i].clear();
  scanf("%s%s",s+1,t+1);
  rep(i,1,n) a[i]=s[i]-'0';
  rep(i,1,n) b[i]=t[i]-'0';
  rep(i,2,n) {
    int u=read(), v=read();
    e[u].eb(v), e[v].eb(u);
    deg[u]++, deg[v]++;
  } 
  rep(i,1,n) cnt[a[i]]++;
  rep(i,1,n) if(!cnt[b[i]]) {puts("NIE"); return;}
  bool flag1=0, flag2=0, flag3=1;
  rep(i,1,n) flag3&=(a[i]==b[i]);
  if(flag3) {puts("TAK"); return;}
  rep(i,1,n) flag1|=(deg[i]>2);
  rep(i,1,n) for(int j:e[i]) flag2|=(b[i]==b[j]);
  if(flag1&&flag2) {puts("TAK"); return;}
  if(!flag2) {puts("NIE"); return;}
  int x=0,m=0; rep(i,1,n) if(deg[i]==1) x=i;
  for(;!vst[x];) {
    p[++m]=x; vst[x]=1;
    for(int j:e[x]) if(!vst[j]) {x=j; break;}
  }
  int cx=0,cy=0;
  rep(i,1,m-1) {
    if(a[p[i]]!=a[p[i+1]]) cx++;
    if(b[p[i]]!=b[p[i+1]]) cy++;
  }
  if(cx<cy||(cx==cy&&a[p[1]]!=b[p[1]])) {puts("NIE"); return;}
  puts("TAK");
}

signed main() {
  int T=read(); rep(i,1,T) work(i);
  return 0;
}