from itertools import accumulate
from bisect import bisect_right


def cumsum(seq, reverse=False) -> list:
    if reverse:
        res = cumsum(reversed(seq))
        res.reverse()
        return res

    return list(accumulate(seq))


N = int(input())
S = input()
A = list(map(int, input().split()))
Q = int(input())
K = list(map(int, input().split()))

ss = cumsum(int(c == 'E') for c in S)
xs = cumsum(A)
for k in K:
    p = bisect_right(xs, k)
    if p == 0:
        print(0)
    else:
        print(ss[p-1])