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

#include<atcoder/modint>
using namespace atcoder;
using mint =modint998244353;

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    string S;
    cin>>N>>S;
    vector<ll> ENE(N+1,0);
    for(int i=0;i<N;i++){
        ENE[i+1]=ENE[i]+(S[i]=='E');
    }
    vector<ll> SA(N+1,0);
    for(int i=0;i<N;i++){
        cin>>SA[i+1];
        SA[i+1]+=SA[i];
    }
    int Q;
    cin>>Q;
    for(int q=0;q<Q;q++){
        ll K;
        cin>>K;
        ll an=0;
        for(int i=0;i<N;i++){
            ll p=upper_bound(SA.begin(),SA.end(),SA[i]+K)-SA.begin()-1;
            an=max(an,ENE[p]-ENE[i]);
        }
        cout<<an<<"\n";
    }
}