import bisect
import itertools
E = [10**9]*2001
E[0] = 0
N = int(input())
S = input()
L=[]
for i in range(N):
    if S[i]=='E':
        L.append(1)
    else:
        L.append(0)
A = list(map(int,input().split()))
EC = list(itertools.accumulate(L))+[0]
AC = list(itertools.accumulate(A))+[0]
for i in range(N):
    for j in range(i,N):
        e = EC[j] - EC[i-1]
        a = AC[j] - AC[i-1]
        E[e] = min(E[e],a)



Q = int(input())
K = list(map(int,input().split()))
for i in range(Q):
    print( bisect.bisect_right(E, K[i]) - 1)