#pragma once

#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846   // pi

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, char, ll> t4;

#define rep(a,n) for(int a = 0;a < n;a++)
#define repi(a,b,n) for(int a = b;a < n;a++)

const ll mod = 1000000007;

int main(void)
{
	ll n;
	cin >> n;
	string s;
	cin >> s;
	vector<ll> as(n);
	rep(i, n) {
		cin >> as[i];
	}
	const ll INF = 1e15;
	vector<ll> sums(n + 1, 0);
	vector<ll> es(n+1, 0);
	rep(i, n) {
		sums[i + 1] += as[i] + sums[i];
		es[i + 1] += (s[i] == 'E' ? 1 : 0) + es[i];
	}
	vector<ll> hits(n+1, INF);
	hits[0] = 0;
	rep(i, n + 1) {
		rep(j, i) {
			ll key = es[i] - es[j];
			ll value = sums[i] - sums[j];
			hits[key] = min(hits[key], value);
		}
	}
	for(int i = n-1;i >= 0;i--){
		hits[i] = min(hits[i], hits[i + 1]);
	}
	ll q;
	cin >> q;
	rep(i, q) {
		ll k;
		cin >> k;
		auto p = upper_bound(hits.begin(), hits.end(), k);
		p--;
		cout << (p-hits.begin()) << endl;
	}
	

	return 0;
}