#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#define ll long long
#define ull unsigned long long
#define lll __int128
#define pc __builtin_popcount
#define pr pair<int,int>
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define lb(x) x&-x
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll rint(ll l,ll r){return uniform_int_distribution<ll>(l,r)(rnd);}
const int maxn=202,p=1e9+7;
void read(int &X)
{
	X=0;
	bool fu=0;
	char cr=getchar();
	while((cr<'0'||cr>'9')&&cr!='-') cr=getchar();
	if(cr=='-') cr=getchar(),fu=1;
	while(cr>='0'&&cr<='9') X=(X<<3)+(X<<1)+(cr^48),cr=getchar();
	X=(fu?-X:X);
}
int T,n,a[maxn],ans,f[maxn][maxn][maxn],S[maxn][maxn][maxn],G[maxn][maxn];
char M[maxn][maxn];
int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	read(T);
	while(T--)
	{
		memset(f,0,sizeof(f)),memset(S,0,sizeof(S));
		ans=0;
		read(n);
		for(int i=1;i<=n;i++) read(a[i]);
		for(int i=1;i<=n;i++) scanf("%s",&M[i][1]);
		for(int i=1;i<=n;i++)
		{
			memset(G,0,sizeof(G));
			for(int j=1;j<=n;j++)
			{
				for(int k=1;k<=n;k++)
				{
					S[i][j][k]=(S[i-1][j][k]+f[i-1][j][k])%p;
					G[j][k]=(1ll*G[j-1][k]+G[j][k-1]-G[j-1][k-1]+1ll*(M[a[j]][a[i]]-'0')*S[i][j][k]+p)%p;
				}
			}
			for(int j=1;j<=n;j++)
				for(int k=1;k<=n;k++)
					f[i][j][k]=(a[i]==a[j]&&a[j]==a[k])*(1ll+G[j-1][k-1])%p,ans=(ans+f[i][j][k])%p;
		}
		printf("%d\n",ans);
	}
	return 0;
}