#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")

// Begin {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }

template <class T>
inline vector<T> make_v(const T &initvalue, size_t sz) {
    return vector<T>(sz, initvalue);
}

template <class T, class... Args>
inline auto make_v(const T &initvalue, size_t sz, Args... args) {
    return vector<decltype(make_v<T>(initvalue, args...))>(sz, make_v<T>(initvalue, args...));
}

constexpr int INF = 0x3f3f3f3f;
constexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
// }}} End

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    size_t N; cin >> N;
    string s; cin >> s;

    vector<intmax_t> cum(N + 1);
    for (size_t i = 1; i <= N; ++i) {
        cum[i] = cum[i - 1] + (s[i - 1] == 'E');
    }

    vector<intmax_t> a(N + 1);
    for (size_t i = 1; i <= N; ++i) {
        cin >> a[i];
    }

    size_t Q; cin >> Q;
    while (Q--) {
        size_t K; cin >> K;
        intmax_t maxv = 0;
        int right = 1, sum = 0;
        for (int left = 1; left <= N; ++left) {
            while (right <= N && sum + a[right] <= K) {
                sum += a[right];
                right++;
            }
            chmax(maxv, cum[right - 1] - cum[left - 1]);
            if (right == left) {
                right++;
            } else {
                sum -= a[left];
            }
        }
        cout << maxv << "\n";
    }

    return 0;
}