// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
  ll n,q,ans,k,le,ri,v;
  string s;
  cin >> n >> s;
  ll a[n];
  ll cnt[n+1];
  fill(cnt,cnt+n+1,0);
  for(int i=0;i<n;i++){
    cin >> a[i];
    if(s[i]=='E'){
      cnt[i]++;
    }
    if(i!=0)cnt[i]+=cnt[i-1];
  }
  cin >> q;
  ll tmp;
  for(int i=0;i<q;i++){
    cin >> k;
    ans = 0;
    le=0;
    ri=0;
    v=0;
    while(ri<n){
      if(v<=k&&ri!=0){
        tmp = cnt[ri-1];
        if(le!=0) tmp-=cnt[le-1];
//        cout << le<<" "<<ri<<" "<<tmp<<endl;
        ans = max(ans,tmp);
      }
      if(v<=k||ri==le){
        v += a[ri++];
      }else{
        v -= a[le++];
      }
    }
    if(v<=k){
      tmp = cnt[ri-1];
      if(le!=0) tmp-=cnt[le-1];
      ans = max(tmp,ans);
    }
    cout << ans << endl;
  }
}