#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};
constexpr ll INF = 1LL << 60;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<ll> hp(n);
    for(int i=0;i<n;++i){
        cin >> hp[i];
    }

    vector<vector<ll>> hp_sum(n, vector<ll>(n+1, INF));   
    // hp_sum[i][j] := i番目の E or W から (i 番目を含む) j 体倒すのに必要な威力
    vector<ll> min_k(n+2, INF);
    // min_k[i] := i 体倒すのに必要な最小威力
    min_k[0] = 0;
    int n_enemy = 0;
    for(int i=0;i<n;++i) {
        hp_sum[i][0] = 0;
        int cnt_enemy = 0;
        ll prev_sum = 0;
        for(int j=i;j<n;++j) {
            if(s[j] == 'E') {
                ++cnt_enemy;
                hp_sum[i][cnt_enemy] = prev_sum + hp[j];
                min_k[cnt_enemy] = min(min_k[cnt_enemy], hp_sum[i][cnt_enemy]);
            }
            prev_sum += hp[j];
        }
        if(s[i] == 'E') ++n_enemy;
    }

    int q;
    ll k;
    cin >> q;
    while(q--) {
        cin >> k;
        auto itr = upper_bound(min_k.begin(), min_k.end(), k);
        cout << max(min(int(distance(min_k.begin(), itr))-1, n_enemy), 0) << endl;
    }
}