#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
//typedef vector<unsigned int>vec;
typedef vector<ll>vec;
typedef vector<vec> mat;
typedef vector<vector<int>> Graph;

const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
//const ll MOD = 998244353;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,Q;
    string S;
    cin >> N >> S;

    vector<ll> A(N);
    REP(i,N) cin >> A[i];
    vector<ll> cum(N+1);
    REP(i,N){
        if(S[i] == 'E') cum[i] = 1;
        if(i > 0) cum[i] += cum[i-1];
    }

    cin >> Q;
    while(Q--){
        ll x;
        cin >> x;
        ll ans = 0;
        ll sum = 0;
        int r = 0;
        for(int l=0;l<N;l++){
            while(r < N && sum + A[r] <= x){
                sum += A[r];
                r++;
            }
            chmax(ans, cum[r] - cum[l]);
            sum -= A[l];
        }
        cout << ans << endl;
    }
}