/*
このコード、と～おれ!
Be accepted!
∧＿∧ 
（｡･ω･｡)つ━☆・*。
⊂   ノ    ・゜+.
 しーＪ   °。+ *´¨)
          .· ´¸.·*´¨) ¸.·*¨)
                            (¸.·´ (¸.·'* ☆
                                        */


#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>

#define rep(i, n) for(int i = 0; i < (n); ++i)
#define rep1(i, n) for(int i = 1; i <= (n); ++i)
#define rep2(i, n) for(int i = 2; i < (n); ++i)
#define repr(i, n) for(int i = n; i >= 0; --i)
#define reprm(i, n) for(int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a)//少数出力
#define printdbd(a) printf("%.16lf\n", a)//少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str())//string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2)//等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg)/360.0)*2.0*PI)
#define rad_to_deg(rad) (((rad)/2.0/PI)*360.0)
#define Please return
#define AC 0


using ll = long long;


const int INF = 1073741823;
const int MINF = -1073741823;
const ll LINF = ll(4661686018427387903);
const ll MOD = 1000000007;
const double PI = acos(-1);


using namespace std;


void scans(string& str) {
        char c;
        scanf("%c", &c);
        if (c == '\n')scanf("%c", &c);//最初の改行対策
        while (c != '\n' && c != -1) {
                str += c;
                scanf("%c", &c);
        }
}


void scanc(char& str) {
        char c;
        scanf("%c", &c);
        if (c == -1)return;
        while (c == '\n') {
                scanf("%c", &c);
        }
        str = c;
}


double acot(double x) {
        return PI / 2 - atan(x);
}


/*-----------------------------------------ここからコード-----------------------------------------*/


int main() {


        int n;
        cin >> n;
        string s;
        cin >> s;
        vector<ll> a(n);
        rep(i, n)cin >> a[i];
        ll right = 0, left = 0;
        int q;
        cin >> q;
        ll k;
        ll sum = 0, enemy = 0, ans = MINF;
        rep(qq, q) {
                right = left = sum = enemy = 0;
                ans = MINF;




                cin >> k;
                for (left = 0; left < n; ++left) {
                        while (right < n && sum + a[right] <= k) {
                                sum += a[right];
                                enemy += (s[right] == 'E');
                                ++right;
                        }


                        ans = max(ans, enemy);


                        if (right == left) {
                                
                                        ++right;
                                
                        }else{
                        sum -= a[left];
                        enemy -= (s[left] == 'E');
}
                }
                cout << ans << endl;
        }




        Please AC;
}