//#define _GLIBCXX_DEBUG
#include "bits/stdc++.h"

using namespace std;

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//{akane : ascending order, aoi : decending order} priority queue
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;
//------------------------------- Libraries --------------------------------//

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    int n;
    cin >> n;
    seika s;
    cin >> s;
    akari<i64> as(n);
    for (int i = 0; i < n; i++)
    {
        cin >> as[i];
    }
    int q;
    cin >> q;
    akari<pair<i64, int>> qs(q);
    for (int i = 0; i < q; i++)
    {
        cin >> qs[i].first;
        qs[i].second = i;
    }
    sort(qs.begin(), qs.end());
    akari<int> ans(q);
    for (int l = 0; l < n; l++)
    {
        int defeat = 0;
        i64 accHP = 0;
        int eitr = l - 1;
        for (int i = 0; i < q; i++)
        {
            while (eitr + 1 < n && qs[i].first >= accHP + as[eitr + 1])
            {
                accHP += as[eitr + 1];
                eitr++;
                if (s[eitr] == 'E')
                {
                    defeat++;
                }
            }
            ans[qs[i].second] = max(ans[qs[i].second], defeat);
        }
    }

    for (int a : ans)
    {
        cout << a << '\n';
    }
}

int main()
{
    solve();
    return 0;
}