#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;


/**
 * @details eは単位元
 */
template <typename T, typename Func>
class SegmentTree{
protected:
  int size;
  std::vector<T> data;
  const T e;
  const Func f;

  inline T get_aux(int x, int y, int i, int l, int r) const {
    if(r <= x || y <= l) return e;
    else if(x <= l && r <= y) return data[i];
    else return f(get_aux(x,y,i*2+1,l,(l+r)/2), get_aux(x,y,i*2+2,(l+r)/2,r));
  };

public:
  SegmentTree(int n, const T &e, const Func &f): e(e), f(f){
    size = 1;
    while(size < n) size *= 2;
    size = size*2-1;
    data = std::vector<T>(size, e);
  }

  inline T operator[](int i) const {
    return at(i);
  }

  inline T at(int i) const {
  	return data[(size+1)/2 + i - 1];
  }

  inline T get(int x, int y) const { // [x,y)
    return get_aux(x,y,0,0,(size+1)/2);
  }

  inline void update(int i, const T &x){
    int j = i+(size+1)/2-1;
    data[j] = x;
    --j;
    while(j>=0){
      data[j/2] = f(data[(j/2)*2+1], data[(j/2)*2+2]);
      (j /= 2) -= 1;
    }
  }

  void debug(){
#ifdef DEBUG
    std::cerr << "{";

    for(int i = 0; i <= size/2; ++i){
      if(i) std::cerr << ",";
      std::cerr << data[(size+1) / 2 + i - 1];
    }

    std::cerr << "}" << std::endl;
#endif
  }
};


template <typename T>
auto make_segment_tree_range_sum(int size, const T &e){
  auto f = [](const auto &a, const auto &b){return a + b;};
  return SegmentTree<T, decltype(f)>(size, e, f);
}




int main(){
  int N;
  string S;
  while(cin >> N >> S){
    vector<LLI> A(N); cin >> A;
    int Q; cin >> Q;

    auto seg1 = make_segment_tree_range_sum<LLI>(N, 0);
    auto seg2 = make_segment_tree_range_sum<int>(N, 0);

    REP(i,N){
      seg1.update(i, A[i]);
      if(S[i] == 'E') seg2.update(i, 1);
    }
    
    

    REP(_,Q){
      LLI K; cin >> K;
      int ans = 0;

      REP(i,N){
        {
          int lb = i-1, ub = N;
          while(abs(lb-ub) > 1){
            int mid = (lb+ub) / 2;

            if(seg1.get(i, mid+1) <= K){
              lb = mid;
            }else{
              ub = mid;
            }
          }

          chmax(ans, seg2.get(i, lb+1));
        }
        


        
      }


      

      cout << ans << endl;
    }
    cerr << endl;
  }
  
  return 0;
}