#include <bits/stdc++.h>
#define FOR(i,j,k) for(int i=(j);i<=(k);++i)
#define NFOR(i,j,k) for(int i=(j);i>=(k);--i)
#define mkp make_pair
#define fst first
#define sec second
#define inl inline
#define pb push_back
#define el_phy_kongroo return 0
using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned int ui;
typedef pair< int,int > pii;
bool memst;
const int inf=0x3f3f3f3f;
const ll infll=0x3f3f3f3f3f3f3f3fll;
inl void telmem()
{
	bool memed;
	cerr<<(&memed-&memst)/1024.0/1024.0<<endl;
}
inl void teltim(int x)
{
	clock_t c1=0;
	if(x) c1=clock();
	else cerr<<endl<<clock()-c1<<"ms"<<endl;
}
void file()
{
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
inl int read()
{
	int s=0,w=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') w=-1; ch=getchar();}
	while(ch>='0'&&ch<='9') {s=(s<<1)+(s<<3)+ch-'0',ch=getchar();}
	return s*w;
}
namespace wheelchair
{
	const ll mod=1e9+7;
	inl ll addmod(ll x,ll y) {return ((ll)x+y)%mod;}
	inl ll mulmod(ll x,ll y) {return 1ll*x*y%mod;}
	inl ll delmod(ll x,ll y) {return (x-y+mod)%mod;}
	inl void addchg(ll &x,ll y) {x=(x+y)%mod;}
	inl void mulchg(ll &x,ll y) {x=(1ll*x*y)%mod;}
	inl void delchg(ll &x,ll y) {x=(x-y+mod)%mod;}
}
using namespace wheelchair;
const int N=205;

int n;
char s[N][N];
ll a[N],dp[N][N],g[N][N];

void sov()
{
	memset(dp,0,sizeof(dp));
	n=read();
	FOR(i,1,n) a[i]=read();
	FOR(i,1,n) scanf("%s",s[i]+1);
	FOR(i,1,n)
	{
		memset(g,0,sizeof(g));
		FOR(j,1,n) FOR(k,1,n) g[j][k]=((g[j-1][k]+g[j][k-1]-g[j-1][k-1]+dp[j-1][k-1]*(s[a[j-1]][a[i]]^48))%mod+mod)%mod;
		FOR(j,1,n) FOR(k,1,n) dp[j][k]=(dp[j][k]+(g[j][k]+1)*(a[i]==a[j])*(a[i]==a[k]))%mod;
	}
	ll ans=0;
	FOR(j,1,n) FOR(k,1,n) addchg(ans,dp[j][k]);
	printf("%lld\n",ans);
}

int main()
{
	//file();
	int _=read();
	while(_--) sov();
	el_phy_kongroo;
}
/*
     ???????
??      ??????
? ?   ??   ?AK??? 
?  ??? NOIP? SDOI??
?  ?????????NOI ??
 ????????????? ??
 ???????????? ???
 ??????????? ????
 ???????     ????
 ????????????
 ?????????
???????????????
*/