#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;


using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned int;
#define rep(i,n) for(int i=0; i<(int)(n); i++)

#include <vector>
#include <string>

template<class T>
vector<int> ZAlgorithm(const T& S) {
    int n = S.size();
    vector<int> res(n, 0);
    res[0] = n;
    int pbegin = 1, pend = 1;
    for (int i = 1; i < n; i++) {
        if (i < pend) {
            res[i] = res[i - pbegin];
            if (pend > i + res[i]) continue;
            res[i] = pend - i;
            pbegin = i;
        }
        else {
            pbegin = pend = i;
        }
        while (true) {
            if (pend == n) break;
            if (S[pend] != S[res[i]]) break;
            res[i]++;
            pend++;
        }
    }
    return res;
}


using modint = atcoder::static_modint<1'000'000'007>;


int main() {
    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];
    string S; cin >> S;

    if(N == 1){
        modint ans = modint(A[0]) * modint(A[0]+1) / 2;
        cout << ans.val() << endl;
        return 0;
    }

    string S1 = S.substr(1);
    vector<pair<char, int>> SA1(N-1);
    rep(i,N-1) SA1[i] = make_pair(S[i+1],A[i+1]);

    auto ZS1 = ZAlgorithm(S1);
    auto ZSA1 = ZAlgorithm(SA1);

    vector<i64> sumA(N+1);
    rep(i,N) sumA[i+1] = A[i] + sumA[i];

    modint ans = 0;
    modint inv2 = modint(2).inv();
    rep(i,N){
        if(S[i] != S[0]) continue;
        i64 l = min(A[0], A[i]);
        ans += modint(l) * modint(l+1) * inv2;
        if(A[0] < A[i]){
            ans += modint(A[0]) * modint(A[i]-A[0]);
        }
        //cout << "l = " << l << '\n';
        //cout << "ans = " << ans.val() << '\n';
        if(i != N-1 && A[0] <= A[i]){
            i64 lp = 1;
            i64 rp = 1 + ZSA1[i];
            ans += modint(sumA[rp] - sumA[lp]);
            //cout << "dans = " << modint(sumA[rp] - sumA[lp]).val() << endl;
            if(i+1+ZSA1[i] != N){
                if(S[1+ZSA1[i]] == S[1+i+ZSA1[i]]){
                    ans += modint(min(A[1+ZSA1[i]], A[1+i+ZSA1[i]]));
                }
            }
        }
    }

    cout << ans.val() << '\n';
    return 0;
}




struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;