#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    string s;
    cin >> s;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    vector<ll> edp(n + 1, 0);
    rep(i, n) edp[i + 1] = edp[i] + ((s[i] == 'E') ? 1 : 0);
    ll q;
    cin >> q;
    rep(i, q) {
        ll k;
        cin >> k;
        ll sum = 0, r = -1, ans = 0;
        rep(l, n) {
            if (l > 0) sum -= a[l - 1];
            while((r < (n - 1)) && ((sum + a[r + 1]) <= k)) {
                r++;
                sum += a[r];
            }
            ans = max(ans, edp[r + 1] - edp[l]);
        }
        cout << ans << endl;
    }
    return 0;
}