#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){
	if(y<h && y>=0 && x<w && x>=0) return true;
	return false;
}






int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin >> n;
	vector<int> e(n + 1);
	string s;cin >> s;
	rep(i,n){
		if(s.at(i) == 'E') e.at(i)++;
	}
	for(int i = n - 1; i >= 0; i--) e.at(i) += e.at(i + 1);
	vector<ll> a(n + 1);
	rep(i,n) cin >> a.at(i);
	for(int i = n - 2; i >= 0; i--) a.at(i) += a.at(i + 1);
	int q;cin >> q;
	while(q--){
		ll k;cin >> k;
		int ans = 0;
		rep(i,n){
			int ok = i - 1, ng = n;
			while(abs(ok - ng) > 1){
				int mid = (ok + ng) / 2;
				if(a.at(i) - a.at(mid + 1) <= k) ok = mid;
				else ng = mid;
			}
			if(ok >= i) ans = max(ans, e.at(i) - e.at(ok + 1));
		}
		cout << ans << endl;
	}
}