#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <math.h>
#include <deque>
#include <queue>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    string s; cin >> s;
    vector<ll> a(n),sum(n+1);
    vector<int> e(n+1);
    for(int i=0;i<n;i++){
        cin >> a[i];
        sum[i+1]=sum[i]+a[i];
        e[i+1]=e[i]+(s[i]=='E');
    }
    int q; cin >> q;
    int res;
    while(q--){
        res=0;
        ll k; cin >> k;
        for(int i=0;i<=n;i++){
            int r=upper_bound(sum.begin()+i,sum.end(),sum[i]+k)-sum.begin();
            res=max(res,e[r-1]-e[i]);
        }
        printf("%d\n",res);
    }
}