#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ll n;cin>>n;
    string s;cin>>s;
    ll a[n];rep(i,0,n)cin>>a[i];
    ll q;cin>>q;
    rep(i,0,q){
        ll k;cin>>k;
        ll ans=0;
        ll now=0;
        ll r=-1,l=-1;
        ll sum=0;
        for(;;){
            if(r==n-1){
                while(l<n-1){
                    l++;
                    if(s[l]=='E')now--;
                    sum-=a[l];
                    if(sum<=k)ans=max(ans,now);
                    
                }
                break;
            }
            r++;
            sum+=a[r];
            if(s[r]=='E')now++;
            if(sum<=k)ans=max(ans,now);
            else{
                while(sum>k){
                    l++;
                    if(s[l]=='E')now--;
                    sum-=a[l];
                }
                ans=max(ans,now);
            }
        }
        cout<<ans<<endl;
    }
}