import sys, math
sys.setrecursionlimit(10**8)
sys.set_int_max_str_digits(0)
INF = 10**18
MOD = 998244353
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import product, combinations, permutations, groupby, accumulate
from heapq import heapify, heappop, heappush

N = int(input())
S = input()
A = list(map(int, input().split()))

rui = [0]
for i in range(N):
    if S[i] == 'R':
        rui.append(rui[-1] + A[i])
    else:
        rui.append(rui[-1] - A[i])

m, M = 0, 0
ansl = []
for i in range(1, N + 1):

    candi1 = abs(rui[i] - m)
    candi2 = abs(rui[i] - M)
    ansl.append(max(candi1, candi2))

    # 値更新
    m = min(m, rui[i])
    M = max(M, rui[i])

print(max(ansl))