#include<iostream> 
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int match[110],N;
bool a[110][110],vis[110],bed[110],home[110];
bool Flyer(int p){
	for(int i=1;i<=N;i++){
		if(a[p][i]&&!vis[i]){
			vis[i]=1;
			if(!match[i]||Flyer(match[i])){
				match[i]=p;
				return 1;
			}
		}
	}
	return 0;
}
void Hungary(){
	for(int i=1;i<=N;i++){
		if(!bed[i]||(bed[i]&&!home[i])){
		   	memset(vis,0,sizeof(vis));
		    if(!Flyer(i)){
			    printf("T_T\n");
			    return;
			}
		}
	}
	printf("^_^\n");
	return; 
}
int main(){
	freopen("divideb.in","r",stdin);
	freopen("divideb.out","w",stdout);
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%d",&N);
		for(int i=1;i<=N;i++)scanf("%d",&bed[i]);
		for(int i=1;i<=N;i++)scanf("%d",&home[i]);
		memset(vis,0,sizeof(vis));
		memset(match,0,sizeof(match));
		for(int i=1;i<=N;i++){
			for(int j=1;j<=N;j++){
				scanf("%d",&a[i][j]);
				if(i==j){a[i][j]=1;}
				if(!bed[j]){a[i][j]=0;
				}
			}
		}
		Hungary();
	}
	return 0;
}