#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1);
    vector<vector<int>> f(n + 1, vector<int>(n + 1, 0)), s(n + 1, vector<int>(n + 1, 0));
    vector<string> m(n + 1);
    int ans = 0;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> m[i], reverse(m[i].begin(), m[i].end()), m[i] += ' ', reverse(m[i].begin(), m[i].end());
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
                (f[j][k] += ((f[j - 1][k] + f[j][k - 1]) % mod + (mod - f[j - 1][k - 1]) % mod) % mod) %= mod;
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
                if (m[a[i - 1]][a[j]] == '1')
                    (s[j][k] += f[j - 1][k - 1]) %= mod;
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++) {
                if (a[i] == a[j] && a[i] == a[k])
                    f[j][k] = s[j][k] + 1;
                else
                    f[j][k] = 0;
                (ans += f[j][k]) %= mod;
            }
    }
    cout << ans << '\n';
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}