#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    ll N, a, mi=0, mi2=0, ans=0;
    string S;
    cin >> N >> S;
    vector<ll> A(N+1), B(N+1), C(N+1);
    for (int i=1; i<=N; i++){
        cin >> a;
        if (S[i-1] == 'R') A[i] += a;
        else B[i] += a;
        A[i] += A[i-1];
        B[i] += B[i-1];
    }

    for (int i=1; i<=N; i++){
        ans = max(A[i]-B[i]-mi, ans);
        ans = max(B[i]-A[i]-mi2, ans);
        mi = min(mi, A[i]-B[i]);
        mi2 = min(mi2, B[i]-A[i]);
    }

    cout << ans << endl;

    return 0;
}