#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    string s;
    cin >> s;
    vector<ll> A(N + 1, 0), ene;
    ene.push_back(0);
    rep(i, N) { cin >> A[i + 1]; }

    rep(i, N) { A[i + 1] += A[i]; }
    rep(i, N) {
        if (s[i] == 'E')
            ene.push_back(1);
        else
            ene.push_back(0);
    }

    rep(i, N) { ene[i + 1] += ene[i]; }

    int Q;
    cin >> Q;
    rep(i, Q) {
        ll q;
        cin >> q;
        ll ans = 0;
        rep(j, N + 1) {
            ll tmp = upper_bound(all(A), A[j] + q) - A.begin() - 1;
            ans = max(ans, ene[tmp] - ene[j]);
        }

        cout << ans << endl;
    }
}