#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int n,dp[205][205][205],g[205][205][205],h[205][205][205],a[205]; char m[205][205];
int main() {
	cin.tie(0)->sync_with_stdio(false);
	int T; scanf("%d",&T); while(T--) { //I guess the sol is (and is only) counting 3 subseqs, use sth like prefix to get better.
		scanf("%d",&n); for(int i = 1; i <= n; i++) scanf("%d",&a[i]);
		for(int i = 1; i <= n; i++) scanf("%s",m[i]+1);
		for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) for(int k = 1; k <= n; k++) {
			dp[i][j][k] = g[i][j][k] = h[i][j][k] = 0;
			if(a[i] == a[j] && a[j] == a[k]) dp[i][j][k] = 1;
		}
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= n; j++) {
				for(int k = 1; k <= n; k++) {
					if(m[a[j]][a[i]] == '1') (g[i][j][k] += dp[i-1][j][k]) %= mod; //extend once
					if(a[i] == a[j]) (h[i][j][k] += g[i][j-1][k]) %= mod; //extend twice
					if(a[i] == a[k]) (dp[i][j][k] += h[i][j][k-1]) %= mod;
					(dp[i][j][k] += dp[i-1][j][k]) %= mod;
					(g[i][j][k] += g[i][j-1][k]) %= mod;
					(h[i][j][k] += h[i][j][k-1]) %= mod;
				}
			}	
		}
		int ans = 0; for(int j = 1; j <= n; j++) for(int k = 1; k <= n; k++) (ans += dp[n][j][k]) %= mod;
		printf("%d\n",ans);
	}
	return 0;
}