#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;

int main(){
    int N;cin>>N;
    string s;cin>>s;
    vector<int> A(N);
    vector<ll> S(N+1),cnt(N+1);
    REP(i, N){
        cin >> A[i];
        S[i+1]=S[i]+A[i];
        if(s[i]=='E'){
            cnt[i+1]=cnt[i]+1;
        }
        else cnt[i+1]=cnt[i];
    }
    vector<ll> M(N+1,1LL<<55);
    REP(i,N) rep(j,i+1,N+1){
        int c=cnt[j]-cnt[i];
        M[c]=min(M[c], S[j]-S[i]);
    }
    vector<pair<ll,int>> que;
    que.push_back(make_pair(0,0));
    REP(i,N-1){
        if(M[i]<M[i+1]&&M[i+1]>M[i+2]||M[i+1]==1LL<<55) continue;
        que.push_back(make_pair(M[i+1],i+1));
    }
    que.push_back(make_pair(M[N],N));
    int Q;cin>>Q;
    REP(q,Q){
        ll K;cin>>K;
        int C=lower_bound(All(que),make_pair(K+1,0))-que.begin();
        C--;
        cout<<que[C].second<<endl;
    }
}