# 累積和、enemy count 
# 任意の場所から打てるときの最大値
# つまりある区間の和がk以下のときのEの数

N = int(input())
S = input()
enemy_count = [0]*(N+1)
for i in range(N):
    if i == 0:
        if S[i] == 'E':
            enemy_count[i+1] = 1
        else:
            enemy_count[i+1] = 0
    else:
        if S[i] == 'E':
            enemy_count[i+1] = enemy_count[i]+1
        else:
            enemy_count[i+1] = enemy_count[i]       
HP = list(map(int, input().split()))
HP_cumu = [0]
temp = 0
for i in range(N):
    temp += HP[i]
    HP_cumu.append(temp)

from bisect import *
Q = int(input())
K = list(map(int, input().split()))
for k in K:
    if k == 0:
        print(0)
        continue
    
    ans = 0
    for i in range(N):
        base = HP_cumu[i]
        idx = bisect_left(HP_cumu, base+k)
        if idx > N:
            calc = enemy_count[N]-enemy_count[i]
        elif HP_cumu[idx] == base+k:
            calc = enemy_count[idx]-enemy_count[i]
        else:
            calc = enemy_count[idx-1]-enemy_count[i]
        ans = max(ans, calc)
        #print('i', i, 'idx', idx, 'base', base, 'calc', calc, ans)
    print(ans)