#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = long long;
using pll = pair<ll,ll>;
constexpr ll INF = (1LL<<60);
constexpr ll MOD = (1e9+7);
//constexpr ll MOD = (998244353);
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
void dump(){cerr<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cerr<<h<<", ";dump(forward<Ts>(t)...);}
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}

signed main(){

  ll n;
  string s;
  cin>>n>>s;
  vector<ll> a(n);
  cin>>a;
  ll q;
  cin>>q;
  vector<ll> k(q);
  cin>>k;

  vector<ll> ssum(n+1);
  rep(i,n)ssum[i+1]=ssum[i]+(s[i]=='E'?1:0);
  vector<ll> asum(n+1);
  rep(i,n)asum[i+1]=asum[i]+a[i];
  auto aasum = make_vector<ll>(n,n);
  auto sssum = make_vector<ll>(n,n);
  rep(i,n)for(ll j=i;j<n;++j){
    aasum[i][j] = asum[j+1]-asum[i];
    sssum[i][j] = ssum[j+1]-ssum[i];
  }
  rep(i,n)for(ll j=1;j<n;++j){
    sssum[i][j]=max(sssum[i][j],sssum[i][j-1]);
  }

  auto f = [&](ll x){
    ll res = 0;
    rep(i,n){
      auto itr = upper_bound(aasum[i].begin(),aasum[i].end(),x);
      if(itr==aasum[i].begin())continue;
      --itr;
      res = max(res,sssum[i][itr-aasum[i].begin()]);
    }
    return res;
  };

  for(auto x:k){
    cout<<f(x)<<endl;
  }

  //for(auto y:aasum){for(auto x:y)cout<<x<<" ";cout<<endl;}
  //for(auto y:sssum){for(auto x:y)cout<<x<<" ";cout<<endl;}

}