N = int(input()) S = input() A = tuple(map(int, input().split())) Q = int(input()) K = tuple(map(int, input().split())) for i in range(Q): req = 0 ans = 0 right = 0 for left in range(N): while right < N and req + A[right] <= K[i]: req += A[right] right += 1 ans = max(ans, S[left:right].count('E')) if left == right: right += 1 else: req -= A[left] print(ans)