#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 207;
constexpr int mod = 1000000007;

char M[N][N];

int n, a[N], f[N][N], g[N][N];

inline void add(int &x, int y) {x = (x + y >= mod ? x + y - mod : x + y);}

inline void work() {
	ll ans = 0;
	scanf("%d", &n);
	rep(i, 1, n) scanf("%d", &a[i]);
	rep(i, 1, n) scanf("%s", M[i] + 1);
	memset(f, 0, sizeof(f));
	memset(g, 0, sizeof(g));
	rep(i, 1, n) {
		rep(j, 1, n) 
			rep(k, 1, n) {
				f[j][k] = ((a[i] == a[j] && a[i] == a[k]) ? (g[j][k] + 1) : 0);
				ans += f[j][k];
			}
		rep(j, 1, n) rep(k, 1, n) {
			add(f[j][k], f[j - 1][k]);
			add(f[j][k], f[j][k - 1]);
			add(f[j][k], mod - f[j - 1][k - 1]);
		}
		rep(j, 1, n) rep(k, 1, n) 
			if (M[a[i]][a[j]] == '1') add(g[j][k], f[j - 1][k - 1]);
	}
	printf("%lld\n", ans % mod);
}

int main() {
	int t; 
	scanf("%d", &t);
	while (t--) work();
	return 0;
}