from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
# 0~9を並び替えるならpermutationsかconbinations,N列のカテゴリを作るにはproduct
from itertools import product, permutations, combinations, accumulate
from functools import lru_cache  # @lru_cache(maxsize=128)
import operator
from string import ascii_uppercase, ascii_lowercase, digits  # 英字(大文字), 英字(小文字), 数字
MOD = 998244353
def II(): return int(input())
def LI(): return list(input())
def LMI(): return list(map(int, input().split()))
def LMS(): return list(map(str, input().split()))
def LLMI(x): return [list(map(int, input().split())) for _ in range(x)]
def LLMS(x): return [list(input()) for _ in range(x)]
  
def execute():
    n = II()
    s = LI()
    a = LMI()
    q = II()
    K = LMI()

    enemy_cum = [0]
    num_cum = [0]
    for i in range(n):
        if s[i] == 'E':
            enemy_cum.append(enemy_cum[-1] + 1)
        else:
            enemy_cum.append(enemy_cum[-1])
        
        num_cum.append(num_cum[-1] + a[i])
    
    for k in K:
        result = 0
        for i in range(n+1):
            idx = bisect_right(num_cum, k + num_cum[i])
            result = max(result, enemy_cum[idx - 1] - enemy_cum[i])
        print(result)
        

if __name__ == "__main__":
    T = 1
    for _ in range(T):
        execute()