import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

from bisect import bisect

n=II()
s=SI()
aa=LI()
se=[0]
for c in s:se.append(se[-1]+(c=="E"))
sa=[0]
for a in aa:sa.append(sa[-1]+a)

etop=[inf]*(n+1)
etop[0]=-1
for r in range(n+1):
    for l in range(r):
        e=se[r]-se[l]
        p=sa[r]-sa[l]
        etop[e]=min(etop[e],p)
# print(etop)

II()
for k in LI():
    i=bisect(etop,k)
    print(i-1)