#include<bits/stdc++.h>

using namespace std;

#define MAXN 55

struct edge

{

        int to,nxt;

} e[MAXN * MAXN];

int i,j,n,T,tot;

int a[MAXN],b[MAXN],head[MAXN],match[MAXN << ];

bool visited[MAXN << ];

bool g[MAXN][MAXN];

bool ans;

template <typename T> inline void read(T &x)

{

        int f = ; x = ;

        char c = getchar();

        for (; !isdigit(c); c = getchar())

        {

                if (c == '-') f = -f;

        }

        for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

        x *= f;

}

inline void addedge(int u,int v)

{

        tot++;

        e[tot] = (edge){v,head[u]};

        head[u] = tot;

}

inline bool hungary(int u)

{

        int i,v;

        visited[u] = true;

        for (i = head[u]; i; i = e[i].nxt)

        {

                v = e[i].to;

                if (!visited[v])

                {

                        visited[v] = true;

                        if (!match[v] || hungary(match[v]))

                        {

                                match[v] = u;

                                return true;

                        }

                }

        }

        return false;

}

int main()

{

        read(T);

        while (T--)

        {

                read(n);

                tot = ;

                for (i = ; i <= n; i++)

                {

                        head[i] = ;

                        match[i] = match[n + i] = ;

                }

                for (i = ; i <= n; i++) read(a[i]);

                for (i = ; i <= n; i++) read(b[i]);

                for (i = ; i <= n; i++)

                {

                        for (j = ; j <= n; j++)

                        {

                                read(g[i][j]);

                        }

                }

                for (i = ; i <= n; i++)

                {

                        if (a[i] == )

                        {

                                if (b[i] == ) continue;

                                for (j = ; j <= n; j++)

                                {

                                        if ((i == j) || (a[j] ==  && g[i][j]))

                                                addedge(i,j + n);

                                }

                        }    else

                        {

                                for (j = ; j <= n; j++)

                                {

                                        if (a[j] ==  && g[i][j])

                                                addedge(i,j + n);

                                }

                        }

                }

                ans = true;

                for (i = ; i <= n; i++)

                {

                        if ((a[i] ==  && b[i] == ) || a[i] == )

                        {

                                memset(visited,false,sizeof(visited));

                                if (!hungary(i))

                                {

                                        ans = false;

                                        break;

                                }

                        }

                }

                if (ans) printf("^_^\n");

                else printf("T_T\n");

        } 

        return ;

}