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

int main() {
	int n; cin >> n;
	vector<vector<int64_t>> hp(n, vector<int64_t>(n, 0));
	int num[n][n] = {};
	string s; cin >> s;
	int64_t a[n]; for(int i = 0; i < n; ++i) cin >> a[i];
	for(int l = 0; l < n; ++l) {
		int64_t sum = 0;
		int cnt = 0;
		for(int r = l; r < n; ++r) {
			sum += a[r];
			cnt += (s[r] == 'E');
			hp[l][r] = sum;
			num[l][r] = cnt;
		}
	}
	int q; cin >> q;
	while(q--) {
		int64_t k; cin >> k;
		int ans = 0;
		for(int l = 0; l < n; ++l) {
			int r = upper_bound(hp[l].begin(), hp[l].end(), k) - hp[l].begin() - 1;
			ans = max(ans, num[l][r]);
		}
		cout << ans << '\n';
	}
	return 0;
}