#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

int main(){
    int N; cin >> N;
    string S; cin >> S;
    vector<ll> A(N);
    rep(i,N){
        cin >> A[i];
    }
    vector<ll> sum(N+1);
    rep(i,N) sum[i+1] = sum[i] + A[i];
    vector<ll> sum2(N+1);
    rep(i,N){
        if(S[i] == 'E') sum2[i+1] = sum2[i]+1;
        else sum2[i+1] = sum2[i];
    }
    int Q; cin >> Q;
    while(Q--){
        int K; cin >> K;
        ll ans = 0;
        rep(i,N){
            int d = upper_bound(sum.begin(),sum.end(),K+sum[i])-sum.begin();
            ans = max(ans,sum2[d-1]-sum2[i]);
        }
        cout << ans << "\n";
    }
}