import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
S = input()[:-1]
A = list(map(int, input().split()))
Q = int(input())
K = list(map(int, input().split()))

for i in range(Q):
    l = 0
    r = 1
    acc = 0
    cnt = 0
    ans = 0
    while r <= N:
        acc += A[r - 1]
        if S[r - 1] == 'E':
            cnt += 1
        while acc > K[i]:
            acc -= A[l]
            if S[l] == 'E':
                cnt -= 1
            l += 1
        ans = max(ans, cnt)
        r += 1
    print(ans)