def maxSum(arr):

  cur_max = glob_max = float('-inf')
  glob_start = glob_end = cur_start = -1

  for index, item in enumerate(arr):

    if item > cur_max + item:
      cur_max = item
      cur_start = index
    else:
      cur_max += item

    if cur_max > glob_max:
      glob_max = cur_max
      glob_start = cur_start
      glob_end = index
  return arr[glob_start:glob_end+1]

N = int(input())
S = input()
A = list(map(int, input().split())) 
R = [0]*N
B = [0]*N
for i in range(N):
    if S[i]=='R':
        A[i]=-A[i]
ans = sum(maxSum(A))
for i in range(N):
    A[i]=-A[i]
ans = max(ans,sum(maxSum(A)))
print(ans)