#include <bits/stdc++.h>

using namespace std;

const int N = 205, P = 1e9 + 7;

void add(int &x, int y) {
    ((x += y) >= P) && (x -= P);
}

int a[N], b[N][N], f[N][N], sum[N][N];

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
        memset(f, 0, sizeof(f));
        for (int i = 1; i <= n; ++i) {
            string S; cin >> S;
            for (int j = 1; j <= n; ++j) b[i][j] = S[j - 1] - '0';
        }
        int res = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                for (int k = 1; k <= n; ++k) {
                    if (!b[a[k]][a[i]]) sum[j][k] = 0;
                    else sum[j][k] = f[j][k];
                    add(sum[j][k], sum[j][k - 1]);
                    add(sum[j][k], sum[j - 1][k]);
                    add(sum[j][k], P - sum[j - 1][k - 1]);
                }
            }
            for (int j = 1; j <= n; ++j) {
                for (int k = 1; k <= n; ++k) {
                    if (a[i] != a[j] || a[j] != a[k] || a[k] != a[i]) continue;
                    add(f[j][k], sum[j - 1][k - 1] + 1);
                    add(res, sum[j - 1][k - 1] + 1);
                }
            }
        }
        printf("%d\n", res);
    }
    return 0;
}