#include <bits/stdc++.h>
using namespace std;
int main () {
  int n;
  cin >> n;
  string s;
  cin >> s;
  vector<int> a(n + 1 , 0);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<long long> sum1(n + 1 , 0);
  for (int i = 1; i <= n; i++) {
     sum1[i] = sum1[i - 1];
     if (s[i - 1] == 'E') sum1[i]++;
  }
  vector<long long> sum2(n + 1 , 0);
  for (int i = 1; i <= n; i++) {
     sum2[i] = sum2[i - 1];
     sum2[i] += a[i];
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int K;
    cin >> K;
    long long ans = 0;
    for (int j = 1; j <= n; j++) {
      for (int k = j; k <= n; k++) {
        long long now = sum2[k] - sum2[j - 1];
        if (now <= K) ans = max(ans , sum1[k] - sum1[j - 1]);
      }
    }
    cout << ans << endl;
  }
  return 0;
}