#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i,n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin() , v.end()
#define inputv(v,n) rep(i,n){\
    ll x;\
    cin>>x;\
    v.push_back(x);\
    }
const ll INF = 999999999999999;
const ll MOD = 1000000007;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans = 0;
int main() {
	cin >> n;
	vl A,B,C,D;
	rep(i, n) {
		char K;
		cin >> K;
		if (K == 'E')B.push_back(1);
		else B.push_back(0);
	}
	inputv(A, n);
	C.push_back(0);
	D.push_back(0);
	rep(i, n) {
		C.push_back(C.back() + A[i]);
		D.push_back(D.back() + B[i]);
	}

	vl kyori(n + 2, INF);
	rep(i, n+1) {
		rep(j, i+1) {
			x = C[i] - C[j];
			y = D[i] - D[j];
			kyori[y] = min(kyori[y], x);
		}
	}

	cin >> q;
	while (q--) {
		cin >> a;
		cout << upper_bound(all(kyori), a) - kyori.begin()-1 << endl;
	}
}