#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 10
#else
#define SIZE 2345
#endif

int N,K,Q;
string S;
int A[SIZE];


void solve() {
    cin>>N>>S;
    REP(i,N)cin>>A[i];
    vector<int> C(N, LONG_LONG_MAX); // i体倒すのに必要な最小コスト
    
    C[0] = 0;
    REP(i,N) {
        int cost = 0;
        int e = 0;
        FOR(j,i,N) {
            cost += A[j];
            if (S[j]=='E') e++;
            C[e] = min(C[e], cost);
        }
    }
    
    cin>>Q;
    while(Q--) {
        cin>>K;
        int l=0, r=N+1;
        REP(i,12) {
            int n = (l+r)/2;
            if (C[n] <= K) l=n;
            else r=n;
        }
        cout << l << endl;
    }
}