#include <bits/stdc++.h>

using namespace std;

const int N = 210, mod = 1e9 + 7;
int a[N], f[N][N][N], g[N][N], h[N][N];
char s[N][N];

void inc(int &x, int y) { ((x += y) >= mod) && (x -= mod); }

void solve() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> s[i] + 1;
  for (int i = 1; i <= n; i++) fill(g[i], g[i] + n + 1, 0), fill(h[i], h[i] + n + 1, 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++) {
        f[i][j][k] = 0;
        if (a[i] == a[j] && a[i] == a[k]) {
          f[i][j][k] = 1;
          inc(f[i][j][k], h[j][k]);
          inc(ans, f[i][j][k]);
        }
      }
    }
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= n; k++) {
        g[j][k] = f[i][j][k];
        inc(g[j][k], g[j][k - 1]);
        inc(g[j][k], g[j - 1][k]);
        inc(g[j][k], mod - g[j - 1][k - 1]);
      }
    }
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= n; k++) {
        if (a[j] == a[k] && s[a[i]][a[j]] - '0') {
          inc(h[j][k], g[j - 1][k - 1]);
        }
      }
    }
  }
  cout << ans << '\n';
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int T;
  cin >> T;
  while (T--) solve();
  return 0;
}