#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

using lint = long long;
constexpr lint INF = 1LL << 60;

void solve() {
    int n;
    std::string s;
    std::cin >> n >> s;

    std::vector<lint> xs(n);
    for (auto& x : xs) std::cin >> x;

    std::vector<lint> need(n + 1, INF);
    need[0] = 0;

    for (int q = 0; q < 2; ++q) {
        for (int l = 0; l < n; ++l) {
            int cnt = 0;
            lint cost = 0;

            for (int i = l; i < n; ++i) {
                if (s[i] == 'E') ++cnt;
                cost += xs[i];
                need[cnt] = std::min(need[cnt], cost);
            }
        }

        std::reverse(s.begin(), s.end());
        std::reverse(xs.begin(), xs.end());
    }

    int q;
    std::cin >> q;
    while (q--) {
        lint k;
        std::cin >> k;

        std::cout << std::upper_bound(need.begin(), need.end(), k) - need.begin() - 1
                  << std::endl;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}