#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;


// 一次元累積和
template <typename T> class Accum1D{
public:
  vector<T> accum;

  Accum1D(vector<T> &v){
    int n = v.size();
    accum = vector<T>(n+1);
    REP(i,n) accum[i+1] = accum[i] + v[i];
  }

  T get(int i, int j){ //[i,j)
    return accum[j] - accum[i];
  }
};





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

    vector<int> count(N);
    REP(i,N) if(S[i] == 'E') count[i] = 1;

    auto seg1 = Accum1D<LLI>(A);
    auto seg2 = Accum1D<int>(count);

    
    

    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;
}