#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;

template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

int main() {
	int n; scanf("%d", &n);
	std::string s; cin >> s;
	std::vector<i64> a(n + 2), b(n + 2);
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]);

	// pre
	a[n + 1] = 1LL << 60;
	for(int i = 0; i < n; i++) b[i + 1] = (s[i] == 'E');
	for(int i = 0; i < a.size() - 1; i++) {
		a[i + 1] += a[i];
		b[i + 1] += b[i];
	}

	int q; scanf("%d", &q);
	while(q--) {
		i64 k; scanf("%lld", &k);

		int ans = 0;
		for(int i = 0; i < n; i++) {
			int r = upper_bound(begin(a), end(a), a[i] + k) - begin(a);
			
			ans = std::max<int>(ans, b[r - 1] - b[i]);
		}
		printf("%d\n", ans);
	}
	
	
	return 0;
}