#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N; string S;
	cin >> N >> S;
	vector<long long> A(N);
	for(int i = 0; i < N; ++i) cin >> A[i];
	long long sum = 0;
	vector<long long> seq;
	for(int i = 0; i < N; ++i) {
		sum += A[i];
		if(S[i] == 'E') seq.push_back(sum);
	}
	int Q;
	cin >> Q;
	while(Q--) {
		long long x;
		cin >> x;
		cout << lower_bound(seq.begin(), seq.end(), x + 1) - seq.begin() << endl;
	}
	return 0;
}