#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------
int n;
string s;
const int MX = 2*1e3+4;
ll a[MX];
int b[MX];

void solve() {
    ll k; cin >> k;
    int left = 0; int cnt = 0;
    ll rem = k;
    FOR(i,0,n-1) {
        while(rem >= a[left] and left < n) {
            if(s[left]=='E') cnt++;
            rem -= a[left];
            left++;
        }

        b[i] = cnt;

        if(i < left) {
            if(s[i] == 'E') cnt--;
            rem+=a[i];
        } else {
            left++;
        }
    }
    int ans = 0;
    FOR(i,0,n-1) chmax(ans, b[i]);
    cout << ans << endl;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    int Q; cin >> n >> s;
    FOR(i,0,n-1) cin >> a[i];
    cin >> Q;
    while(Q--) solve();
    return 0;
}