from bisect import bisect_right
N = int(input())
S = input()
hp = list(map(int, input().split()))
enemy_count = S.count('E')
enemy_pos = [-1]

for i in range(N):
    if S[i] == 'E':
        enemy_pos.append(i)

accs = [[] for _ in range(enemy_count+1)]

for i in range(1, enemy_count+1):
    power = 0
    for j in range(enemy_pos[i], N):
        power += hp[j]
        if S[j] == 'E':
            accs[i].append(power)


Q = int(input())
ans_a = []
for power in map(int, input().split()):
    ans = 0
    for i in range(1, enemy_count+1):
        ans = max(ans, bisect_right(accs[i], power))
    ans_a.append(ans)

print(*ans_a, sep='\n')