#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  string S; cin >> S;
  vector<int> A(N); rep(i,N) cin >> A[i];
  vector<int> sums(N+1,0);
  rep(i,N) sums[i+1] = sums[i] + A[i];
  vector<int> esum(N+1,0);
  rep(i,N) esum[i+1] = esum[i] + ((S[i]=='E')?1:0);
  // rep(i,N+1) cout << esum[i] << " ";
  int Q; cin >> Q;
  rep(q,Q){
    int K; cin >> K;
    int ans=0;
    int l,r;
    for(l=1,r=1; l<N; l++){
      while(r<N && sums[r+1]-sums[l-1]<=K){
        r++;
      }
      // cout << l << " " << r << " " << esum[r]-esum[l-1] << endl;
      ans = max(ans,esum[r]-esum[l-1]);
    }
    cout << ans << endl;
  }
  return 0;
}