#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    string s; cin >> s;
    vector<long long> a(n);
    vector<long long> mini(n+1, 1e18); mini[0] = 0;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
        long long curr = 0;
        int enemy_count = 0;
        for (int j = i; j < n; j++) {
            enemy_count += s[j] == 'E';
            curr += a[j];
            mini[enemy_count] = min(mini[enemy_count], curr);
        }
    }
    for (int i = n; i > 0; i--) {
        mini[i-1] = min(mini[i-1], mini[i]);
    }
    int q; cin >> q;
    for (int i = 0; i < q; i++) {
        long long k; cin >> k;
        int left = 0; int right = n+1;
        while (right - left > 1) {
            int mid = (right + left) / 2;
            if (mini[mid] <= k) left = mid;
            else right = mid;
        }
        cout << left << "\n";
    }
    return 0;
}