#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  int n; string s; cin >> n >> s;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<vector<long long> > sum(n);
  vector<vector<int> > enemy(n);
  REP(i, n) {
    sum[i].assign(n - i + 1, 0);
    enemy[i].assign(n - i + 1, 0);
    FOR(j, i, n) {
      sum[i][j - i + 1] = sum[i][j - i] + a[j];
      enemy[i][j - i + 1] = enemy[i][j - i] + (s[j] == 'E');
    }
  }
  int q; cin >> q;
  while (q--) {
    int k; cin >> k;
    int ans = 0;
    REP(i, n) {
      int idx = upper_bound(ALL(sum[i]), k) - sum[i].begin();
      ans = max(ans, enemy[i][idx - 1] - enemy[i][0]);
    }
    cout << ans << '\n';
  }
  return 0;
}