#include <bits/stdc++.h>

#include <atcoder/lazysegtree>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

using namespace atcoder;

pll op(pll a, pll b) { return {max(a.fi, b.fi), min(a.se, b.se)}; }

pll e() { return {-INF, INF}; }

pll mapping(lint f, pll x) { return {x.fi + f, x.se + f}; }

lint composition(lint f, lint g) { return f + g; }

lint id() { return 0LL; }

int main() {
    int n;
    string s;
    cin >> n >> s;
    lint a[n];
    rep(i, n) scanf("%lld", &a[i]);

    vector<pll> v(n + 1);
    v[0] = {0, 0};
    rep(i, n) {
        lint tmp = v[i].fi + a[i] * (s[i] == 'R' ? 1 : -1);
        v[i + 1] = {tmp, tmp};
    }
    lazy_segtree<pll, op, e, lint, mapping, composition, id> st(v);

    lint ans = -INF;
    rep(i, n - 1) {
        auto tmp = st.prod(i + 1, n + 1);
        chmax(ans, max(abs(tmp.fi), abs(tmp.se)));
        lint t = st.get(i + 1).fi;
        st.apply(i + 1, n + 1, -t);
    }
    printf("%lld\n", ans);
}