#include<bits/stdc++.h>
using std::cin, std::cout;
using u64 = unsigned long long;
const int mod = 1e9 + 7;
const int N = 205;
int n;
void add(int & x, int y) {
	if((x += y) >= mod) {
		x -= mod;
	}
}
void sub(int & x, int y) {
	x -= y, x += x >> 31 & mod;
}
int dp[N][N][N];
int sum[N][N][N];
std::vector<int> v[N];
int pre[N][N];
int a[N];
void clear() {
	memset(dp, 0, sizeof(dp));
	memset(sum, 0, sizeof(sum));
	memset(pre, 0, sizeof(pre));
	for(int i = 0;i < N;++i) v[i].clear();
}
int ok[N][N];
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T; cin >> T;
	for(int i = 0;i < T;++i) {
		clear();
		cin >> n;
		for(int i = 1;i <= n;++i) {
			cin >> a[i];
			memcpy(pre[i], pre[i - 1], sizeof(pre[0]));
			if(i > 1) pre[i][a[i - 1]] = i - 1;
		}
		for(int i = 1;i <= n;++i) {
			for(int j = 1;j <= n;++j) {
				char c; cin >> c;
				ok[i][j] = c == '1';
			}
		}
		for(int i = 1;i <= n;++i) {
			for(int j = 1;j < i;++j) {
				if(ok[a[j]][a[i]]) v[i].push_back(a[j]);
			}
			sort(v[i].begin(), v[i].end());
			v[i].erase(unique(v[i].begin(), v[i].end()), v[i].end());
		}
		int ans = 0;
		for(int i = 1;i <= n;++i) {
			for(int j = 1;j <= n;++j) {
				for(int k = 1;k <= n;++k) {
					if(a[i] != a[j]) continue;
					if(a[i] != a[k]) continue;
					if(i <= j && j <= k) {
						int su = 1;
						for(int x : v[i]) {
							add(su, sum[pre[i][x]][pre[j][x]][pre[k][x]]);
						}
						dp[i][j][k] = su;
						dp[i][k][j] = su;
						dp[j][i][k] = su;
						dp[j][k][i] = su;
						dp[k][i][j] = su;
						dp[k][j][i] = su;
					}
					add(ans, dp[i][j][k]);
					sum[i][j][k] = dp[i][j][k];
					int pi = pre[i][a[i]];
					int pj = pre[j][a[j]];
					int pk = pre[k][a[k]];
					add(sum[i][j][k], sum[pi][j][k]);
					add(sum[i][j][k], sum[i][pj][k]);
					add(sum[i][j][k], sum[i][j][pk]);

					sub(sum[i][j][k], sum[pi][pj][k]);
					sub(sum[i][j][k], sum[pi][j][pk]);
					sub(sum[i][j][k], sum[i][pj][pk]);

					add(sum[i][j][k], sum[pi][pj][pk]);
				}
			}
		}
		cout << ans << '\n';
	}
}