#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;

using ll = long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void dump(vector<T> v) { for (auto& x : v) cerr << x << " "; cerr << endl; }
template<class T> inline void dump(vector<pair<T, T>> v) { for (auto& p : v) cerr << p.first << " " << p.second << endl; }
template<class T> inline void dump(vector<vector<T>> vv) { for (auto& v : vv) {for (auto& x : v) cerr << x << " "; cerr << endl;} }
const int INF = 1e9;
const long long INFL = 1LL<<60;


int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n = 0;
  cin >> n;
  string s;
  cin >> s;
  vector<ll> a(n + 1);
  a[0] = 0;
  rep(i, n) {
    int v;
    cin >> v;
    if (s[i] == 'R') a[i + 1] = v;
    else a[i + 1] = -v;
  }

  vector<ll> csum(n + 1, 0);
  rep(i, n) {
    csum[i + 1] = csum[i];
    csum[i + 1] += a[i + 1];
  }

  ll ans  = 0;

  ll mi = INF;
  ll ma = -INF;

  rep(i, n) {
    chmin(mi, csum[i]);
    chmax(ma, csum[i]);
    chmax(ans, abs(csum[i+1] - mi));
    chmax(ans, abs(ma - csum[i+1]));
  }

  cout << ans << endl;

  return 0;
}