#include <iostream>
#include <vector>
using namespace std;
int main(void) {
	int n, q, k;
	string s;
	cin >> n >> s;
	vector<int> enemy(n);
	for (int i = 0; i < n; ++i) cin >> enemy[i];
	enemy.push_back(2e9);
	cin >> q;

	for (int i = 0; i < q; ++i) {
		cin >> k;
		int max_cnt = -1;
		long long sum = 0;
		int right = 0, cnt = 0;
		for (int left = 0; left < n; ++left) {
			while (k >= sum + enemy[right] && n > right) {
				sum += enemy[right];
				if (s[right] == 'E') ++cnt;
				++right;
			}
			max_cnt = max(max_cnt, cnt);
			sum -= enemy[left];
			if (s[left] == 'E') --cnt;
		}
		cout << max_cnt << endl;
	}
	return 0;
}