#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 1E9 + 7;

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

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) std::cin >> a[i];

    std::vector<std::vector<bool>> o(n + 1, std::vector<bool> (n + 1));
    for (int i = 1; i <= n; i++) {
        std::string s;
        std::cin >> s;

        for (int j = 1; j <= n; j++) {
            if (s[j - 1] == '1') o[i][j] = 1;
        }
    }

    int ans = 0;
    std::vector<std::vector<int>> sum(n + 1, std::vector<int> (n + 1));
    std::vector<std::vector<int>> f(n + 1, std::vector<int> (n + 1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int k = 1; k <= n; k++) {
                if (!o[a[j]][a[i]]) sum[j][k] = 0;
                else sum[j][k] = f[j][k];

                Inc(sum[j][k], sum[j - 1][k]);
                Inc(sum[j][k], sum[j][k - 1]);
                Inc(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;
                Inc(f[j][k], sum[j - 1][k - 1] + 1);
                Inc(ans, sum[j - 1][k - 1] + 1);
            }
        }
    }
    std::cout << ans << '\n';
}

int main() {
    std::cin.tie(nullptr) -> sync_with_stdio(false);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
    return 0;
}