//Bismillah
#include <bits/stdc++.h>
using namespace std;

#define nl cout<<endl;
#define YN(condition) cout<<(condition?"YES":"NO")
#define yn(condition) cout<<(condition?"Yes":"No")

#define int long long
#define lint __int128
#define ll long long
#define ld long double
#define pii pair<int,int>
#define inf 1e17
#define MOD 1000000007

#define ai(n) array<int,n>
#define ac(n) array<char,n>
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define vpi vector<pair<int,int>>
#define vvi vector<vector<int>>
#define mp map<int,int>
#define pq priority_queue<int>
#define pqmin priority_queue<int, vector<int>, greater<int>>
#define pqminpair priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>

#define f(i,s,e) for(int i=s;i<e;i++)
#define fn(i,s,e) for(int i=s;i>=e;i--)
#define printv(vec) for(auto &value: vec) cout<<value<<" ";
#define inputv(vec) for(auto &value: vec) cin>>value;

#define pb push_back
#define pp pop_back
#define all(s) s.begin(), s.end()
#define sa(vec) sort(vec.begin(), vec.end())
#define sd(vec) sort(vec.begin(), vec.end(), [](int a, int b){return a>b;})

#define fastnuces ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);int t = 1;
int test=0;
void solve(){
    int n;
    cin>>n;
    string s;
    cin>>s;
    vi end(n);
    inputv(end);
    vi pre(n, 0), cnt(n);
    f(i, 0, n){
        pre[i] = end[i];
        if(i)   pre[i]+=pre[i-1];
        cnt[i] = (s[i]=='E');
        if(i)   cnt[i]+=cnt[i-1];
    }
    // printv(cnt);nl;
    int q;
    cin>>q;
    vi query(q);
    inputv(query);
    for(auto &value : query){
        int maxi = 0;
        // nl
        f(i,0, n){
            auto it = upper_bound(pre.begin() + i, pre.end(), value + (i ? pre[i-1] : 0));
            if(it==pre.begin() + i) continue;
            it--;
            int idx = it - (pre.begin());
            maxi = max(maxi, cnt[idx] - (i?cnt[i-1]:0));
            // cout<<i<<" "<<idx<<" "<<maxi<<endl;
        }
        // cout<<endl;
        // auto it = upper_bound(all(pre), value);
        // if(it==pre.begin()){
        //     cout<<0<<" ";
        //     continue;
        // }
        cout<<maxi<<"\n";
        // it--;
        // int i = it - pre.begin();
        // // cout<<value<<" "<<i<<endl;
        // cout<<cnt[i]<<endl;
    }
}
signed main() {
    fastnuces;
    // cin >> t;
    while (t--) {
        test++;
        solve();
        nl
    }
    return 0;
}