#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128; 
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
ll read() {
  ll x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=1005;
int n,a[N],m,b[N],cx,cy,ans;
vi c,d;
priority_queue<int> p,q;
char s[N],t[N];

signed main() {
  n=read();
  scanf("%s",s+1);
  rep(i,1,n) a[i]=read();
  scanf("%s",t+1);
  rep(i,1,n) b[i]=read();
  rep(i,1,n) {
    if(s[i]=='W') c.eb(a[i]);
    else p.push(a[i]);
    if(t[i]=='W') d.eb(b[i]);
    else q.push(b[i]);
  }
  sort(c.begin(),c.end(),greater<int>());
  sort(d.begin(),d.end(),greater<int>());
  for(int x:c) {
    while(!q.empty()&&q.top()>=x) q.pop();
    if(q.empty()) break;
    ans+=x+q.top(); q.pop(); break;
  }
  for(int x:d) {
    while(!p.empty()&&p.top()>=x) p.pop();
    if(p.empty()) break;
    ans+=x+p.top(); p.pop(); break;
  }
  printf("%d\n",ans);
  return 0;
}