#include <bits/stdc++.h>
using namespace std;

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n,q;
  string s;
  
  ll k;

  cin >> n >> s;
  VLL a(n);
  rep(i,n) cin >> a[i];


  FOR(i,1,n){
    a[i] += a[i-1];
  }

  VLL mm(n,0);
  rep(i,n){
    if(s[i] == 'E') mm[i] = 1;
  }
  FOR(i,1,n) mm[i] += mm[i-1];

  cin >> q;
  rep(_,q){
    cin >> k;
    // 打ち始め
    ll ans = 0;
    rep(i,n){
      ll p = 0;
      if(i > 0) p = a[i-1]; 

      ll idx = upper_bound(all(a), p + k ) - a.begin();
      idx --;
      if(i > idx) continue;
      ll res = mm[idx];
      if(i-1 >= 0) res -= mm[i-1];
      ans = max(res,ans);
    }
    cout << ans << endl;
  } 


  return 0;
}