#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cmath> #include <map> #include <queue> #include <iomanip> #include <set> #include <tuple> #define mkp make_pair #define mkt make_tuple #define rep(i,n) for(int i = 0; i < (n); ++i) #define all(v) v.begin(),v.end() using namespace std; typedef long long ll; const ll MOD=1e9+7; template<class T> void chmin(T &a,const T &b){if(a>b) a=b;} template<class T> void chmax(T &a,const T &b){if(a<b) a=b;} string P="RB"; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; cin>>N; string S; cin>>S; vector<ll> A(N); rep(i,N) cin>>A[i]; ll ans=0; rep(t,2){ ll sum=0; ll mi=0; rep(i,N){ if(S[i]==P[t]) sum+=A[i]; else sum-=A[i]; chmax(ans,sum-mi); chmin(mi,sum); } } cout<<ans<<endl; return 0; }