#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
    int N,Q;
    string S;
    long long K;
    cin >> N >> S;
    vector<int> cnt(N+1,0);
    for(int i=0;i<N;i++){
        if(S[i]=='E')cnt[i+1]++;
        cnt[i+1]+=cnt[i];
    }
    
    vector<long long> A(N+1,0);
    for(int i=1;i<=N;i++){
        cin >> A[i];
        A[i]+=A[i-1];
    }
    
    cin >> Q;
    for(int pro=0;pro<Q;pro++){
        cin >> K;
        int ans=0;
        for(int b=0;b<N;b++){
            if(S[b]=='W')continue;
            auto it=upper_bound(A.begin()+b,A.end(),K+A[b]);
            ans=max(ans,cnt[distance(A.begin(),it)-1]-cnt[b]);
        }
        cout<< ans << endl;
    }
    return 0;
}