#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e2 + 10, mod = 1e9 + 7;
int m[N][N], f[N][N], s[N][N], a[N], n;
signed main() {
    int T; cin >> T;
    while (T --) {
        cin >> n; int ans = 0;
        for (int i = 1; i <= n; ++i) cin >> a[i];
        for (int i = 1; i <= n; ++i) for (int j = 1; j <= n; ++j) {
            char ch; cin >> ch;
            m[i][j] = ch - '0'; f[i][j] = s[i][j] = 0;
        }
        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][k] + f[j - 1][k] + f[j][k - 1] - 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]]) {
                        s[j][k] = (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[j] == a[k]) f[j][k] = s[j][k] + 1;
                    else f[j][k] = 0;
                    ans = (ans + f[j][k]) % mod;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}