#include //ios::sync_with_stdio(false);cin.tie(0); using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef tuple 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=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(a0){ 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(lk){ l++; if(s[l]=='E')now--; sum-=a[l]; } ans=max(ans,now); } } cout<