#include <algorithm>
#include <cctype>
#include <cstdio>
#include <set>
#include <vector>

#define debug(...) fprintf(stderr, __VA_ARGS__)

using LL = long long;
const int N = 400000 + 5;

inline int read() {
  int x = 0, f = 1, c;
  while (!isdigit(c = getchar()))
    if (c == '-') f = -1;
  do x = x * 10 + c - '0';
  while (isdigit(c = getchar()));
  return x * f;
}

int n, X, Y;
int a[N], dep[N];
char s[2 * N];
std::vector<int> G[N], P[N];
LL ans;

void dfs(int u) {
  for (auto v : G[u]) {
    dep[v] = dep[u] + 1;
    dfs(v);
  }
}

namespace Sub1 {
std::multiset<int> s;
LL sum;
void solve() {
  for (int i = 1; i <= n; ++i) {
    for (auto v : P[i]) s.insert(a[v]), sum += a[v];
    sum -= *s.rbegin();
    ans += sum;
    s.erase(std::prev(s.end()));
  }  
}
}

namespace Sub2 {
std::multiset<int> s;
LL sum;
void solve() {
  for (int i = 1; i <= n; ++i) {
    for (auto v : P[i]) s.insert(a[v]), sum += a[v];
    ans += sum + LL(*s.begin()) * (s.size() - 2);
    sum -= *s.rbegin();
    s.erase(std::prev(s.end()));
  }
}
}

namespace Sub3 {
std::multiset<int> s;
void try1() {
  LL res = 0;
  for (int i = 1; i <= n; ++i) {
    for (auto v : P[i]) s.insert(a[v]);
    if (s.size() == 1) {
      s.erase(s.begin());
    } else if (i == n - 1) {
      res += *s.begin();
      s.erase(s.begin());
    } else if (s.size() >= 3) {
      int u = *std::next(s.begin());
      res += LL(*s.begin()) * (s.size() - 2) + u;
      s.erase(std::next(s.begin()));
    } else {
      int j = i;
      while (P[j + 1].size() == 1) {
        s.insert(a[P[j + 1][0]]);
        ++j;
      }
      i = j;
      for (auto v : s) res += v;
      int u = *s.begin();
      res -= u;
      s.clear();
      s.insert(u);
    }
  }
  ans = std::min(ans, res);
}
void try2() {
  LL res = 0;
  for (int i = 1; i <= n; ++i) {
    for (auto v : P[i]) s.insert(a[v]);
    if (s.size() == 1) {
      s.erase(s.begin());
    } else if (i == n - 1) {
      res += *s.begin();
      s.erase(s.begin());
    } else if (s.size() >= 3) {
      int u = *std::next(s.begin());
      res += LL(*s.begin()) * (s.size() - 2) + u;
      s.erase(std::next(s.begin()));
    } else {
      int j = i;
      while (P[j + 1].size() == 1) {
        s.insert(a[P[j + 1][0]]);
        ++j;
      }
      i = j;
      for (auto v : s) res += v;
      int u = *s.rbegin();
      res -= u;
      s.clear();
      s.insert(u);
    }
  }
  ans = std::min(ans, res);
}
void solve() {
  ans = 1E18;
  try1();
  try2();
}
}

int main() {
  n = read(), X = read(), Y = read();
  if (!X && !Y) return puts("0"), 0;
  scanf("%s", s + 1);
  for (int i = 1; i <= n; ++i) a[i] = read();
  {
    int tp;
    static int st[N];
    st[tp = 1] = 0;  
    for (int i = 1, cur = 0; i <= 2 * n; ++i) {
      if (s[i] == '(') {
        st[++tp] = ++cur;
      } else {
        G[st[tp - 1]].push_back(st[tp]);
        --tp;
      }
    }
    dfs(0);
    for (int i = 1; i <= n; ++i) P[dep[i]].push_back(i);
  }
  if (X == 0 && Y == 1) Sub1::solve();
  if (X == 1 && Y == 1) Sub2::solve();
  if (X == 1 && Y == 0) Sub3::solve();
  printf("%lld\n", ans);
  return 0;
}