import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); char[] enemies = sc.next().toCharArray(); long[] sums = new long[n + 1]; int[] counts = new int[n + 1]; for (int i = 1; i <= n; i++) { sums[i] = sums[i - 1] + sc.nextInt(); counts[i] = counts[i - 1]; if (enemies[i - 1] == 'E') { counts[i]++; } } TreeMap matrix = new TreeMap<>(); matrix.put(0L, 0); for (int i = 0; i < n; i++) { for (int j = i + 1; j <= n; j++) { long s = sums[j] - sums[i]; int c = counts[j] - counts[i]; if (matrix.floorEntry(s).getValue() < c) { matrix.put(s, c); Long key = s; while ((key = matrix.higherKey(key)) != null) { if (matrix.get(key) <= c) { matrix.remove(key); } else { break; } } } } } int q = sc.nextInt(); StringBuilder sb = new StringBuilder(); while (q-- > 0) { sb.append(matrix.floorEntry(sc.nextLong()).getValue()).append("\n"); } System.out.print(sb); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }