#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll INF = 1000000000000000000;
  ll n;std::cin >> n;
  string s;std::cin >> s;
  vll a(n);get(a);
  vvl cost = VV(n, n+1, 0, ll);
  vvl num = VV(n, n+1, 0, ll);
  for(int i=0;i<n;i++){
    for(int j=1;j<=n;j++){
      if(i+j>n) cost[i][j] = INF;
      else {
        cost[i][j] = cost[i][j-1] + a[i+j-1];
        num[i][j] = (s[i+j-1]=='E'?1:0) + num[i][j-1];
      }
    }
  }
  ll q;std::cin >> q;
  re(T, q){
    ll t;std::cin >> t;
    ll ans = 0;
    for(int i=0;i<n;i++){//始点
      ll idx = upper_bound(all(cost[i]), t) - cost[i].begin() - 1;
      ans = max(ans, num[i][idx]);
    }
    std::cout << ans << '\n';
  }
}