#ifndef CLASS_MODINT
#define CLASS_MODINT

#include <cstdint>

template <std::uint32_t mod>
class modint {
private:
	std::uint32_t n;
public:
	modint() : n(0) {};
	modint(std::int64_t n_) : n((n_ >= 0 ? n_ : mod - (-n_) % mod) % mod) {};
	static constexpr std::uint32_t get_mod() { return mod; }
	std::uint32_t get() const { return n; }
	bool operator==(const modint& m) const { return n == m.n; }
	bool operator!=(const modint& m) const { return n != m.n; }
	modint& operator+=(const modint& m) { n += m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator-=(const modint& m) { n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator*=(const modint& m) { n = std::uint64_t(n) * m.n % mod; return *this; }
	modint operator+(const modint& m) const { return modint(*this) += m; }
	modint operator-(const modint& m) const { return modint(*this) -= m; }
	modint operator*(const modint& m) const { return modint(*this) *= m; }
	modint inv() const { return (*this).pow(mod - 2); }
	modint pow(std::uint64_t b) const {
		modint ans = 1, m = modint(*this);
		while (b) {
			if (b & 1) ans *= m;
			m *= m;
			b >>= 1;
		}
		return ans;
	}
};

#endif // CLASS_MODINT

#include <random>
std::random_device rd;
bool isprime(long long x) {
	if (x <= 1) return false;
	for (int i = 2; 1LL * i * i <= x; i++) {
		if (x % i == 0) {
			return false;
		}
	}
	return true;
}
int generate_random_prime(int L, int R) {
	std::uniform_int_distribution<int> p(L, R - 1);
	int answer;
	do {
		answer = p(rd);
	} while(!isprime(answer));
	return answer;
}

#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
using mint = modint<1000000007>;

int main() {
	// step #1. read input
	int N;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	string S;
	cin >> S;
	
	// step #2. make rolling hash
	const int P = generate_random_prime(1000000000, 1500000000);
	const int base = 311;
	vector<int> val(N), pw(N + 1), hashval(N + 1);
	for (int i = 0; i < N; i++) {
		val[i] = ((S[i] - 'a') + A[i] * 26LL) % P;
	}
	pw[0] = 1;
	for (int i = 0; i < N; i++) {
		pw[i + 1] = 1LL * pw[i] * base % P;
		hashval[i + 1] = (1LL * hashval[i] * base + val[i]) % P;
	}
	function<int(int, int)> gethash = [&](int l, int r) {
		return (hashval[r] - 1LL * hashval[l] * pw[r - l] % P + P) % P;
	};
	
	// step #3. calculate cumulative sum
	vector<long long> SA(N + 1);
	for (int i = 0; i < N; i++) {
		SA[i + 1] = SA[i] + A[i];
	}
	
	// step #4. calculation
	mint answer = 0;
	for (int i = 0; i < N; i++) {
		if (S[i] == S[0] && A[i] >= A[0]) {
			int l = 1, r = N - i + 1;
			while (r - l > 1) {
				int m = (l + r) / 2;
				if (gethash(1, m) == gethash(i + 1, i + m)) {
					l = m;
				}
				else {
					r = m;
				}
			}
			if (l == N - i) {
				answer += SA[l];
			}
			else if (S[l] == S[i + l]) {
				answer += SA[l] + min(A[l], A[i + l]);
			}
			else {
				answer += SA[l];
			}
			answer += mint(1LL * A[0] * (A[0] - 1) / 2);
			answer += mint(A[0]) * (A[i] - A[0]);
		}
		if (S[i] == S[0] && A[i] < A[0]) {
			answer += mint(1LL * A[i] * (A[i] + 1) / 2);
		}
	}
	
	// step #5. output the answer
	cout << answer.get() << endl;
	
	return 0;
}