#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
typedef long long ll;
int main(){
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<ll> a(n);
    rep(i,n){
        cin >> a[i];
    }
    int q;
    cin >> q;
    rep(query,q){
        ll k;
        cin >> k;
        ll wa = 0;
        int ans = 0;
        int r = 0;
        int cnt = 0;
        rep(l,n){
            for(;wa+a[r]<=k && r<n;r++){
                wa+=a[r];
                if(s[r]=='E'){
                    cnt++;
                }
            }
            ans = max(ans,cnt);
            wa-=a[l];
            if(s[l]=='E'){
                cnt--;
            }
        }
        cout << ans << endl;
    }
    return 0;
}