#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define endl '\n'
#define fir first
#define sec second
#define file(__a) freopen(__a".in","r",stdin),freopen(__a".out","w",stdout);
#define look_time cerr<<(clock()-Time)/1000.0<<"s"<<endl
#define look_memory cerr<<(&b2-&b1)/1024.0/1024.0<<"MB"<<endl
using namespace std;
bool b1;
time_t Time = clock();
int T = 1;
template<typename T>
inline void read(T &s) {
	T f = 1, c = 0;
	char ch = getchar();
	while (!isdigit(ch)) {
		if (ch == '-') {
			f = -1;
		}
		ch = getchar();
	}
	while (isdigit(ch)) {
		c = (c << 1) + (c << 3) + (ch ^ 48);
		ch = getchar();
	}
	s = f * c;
}
template<typename T, typename ...Args>
inline void read(T &s, Args &...args) {
	read(s), read(args...);
}
namespace white_carton {
const int mod = 1000000007;
int n, a[210], dp[210][210], s[210][210];
char m[210][210];
void Solve() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> (m[i] + 1);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			s[i][j] = dp[i][j] = 0;
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= n; k++) {
				s[j + 1][k + 1] = (m[a[j]][a[i]] - '0') ? dp[j][k] : 0;
				s[j + 1][k + 1] += ((s[j][k + 1] + s[j + 1][k]) % mod + mod - s[j][k]) % mod;
				s[j + 1][j + 1] %= mod;
			}
		}
		for (int j = 1; j <= n; j++) {
			for (int k = 1; k <= n; k++) {
				if (a[i] == a[j] && a[j] == a[k]) {
					ans += s[j][k] + 1;
					ans %= mod;
					dp[j][k] += s[j][k] + 1;
					dp[j][k] %= mod;
				}
			}
		}
	}
	cout << (ans + mod) % mod << endl;
}
}
bool b2;
signed main() {
	// file("dis");
	cin >> T;
	while (T--)white_carton::Solve();
	look_time;
	look_memory;
}
//日拱一卒，功不唐捐