#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	string s; cin >> s;
	vector<int>c(n + 1);
	rep(i, n)c[i + 1] = c[i] + ('E' == s[i]);
	vector<long long>a(n), sa(n + 1);
	rep(i, n)cin >> a[i];
	rep(i, n)sa[i + 1] = sa[i] + a[i];
	int q; cin >> q;
	while (q--) {
		long long x; cin >> x;
		int ans = 0;
		rep(i, n) {
			long long val = x + sa[i] - sa[0];
			int idx = upper_bound(all(sa), val) - sa.begin();
			chmax(ans, c[idx - 1] - c[i]);
		}
		cout << ans << endl;
	}
	return 0;
}