#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

ll mk_query(vector<int> v, string s) {  
   int n = sz(v) - 1;
   auto cmp = [&](int a, int b) { return v[a] > v[b]; };
   priority_queue<int, vector<int>, decltype(cmp)> heap(cmp);
   int cnt = 0;
   ll total = 0;
   
   for(int i = 1; i < sz(s); i++) {
      if(s[i] == '(') cnt++;
      else cnt--, heap.emplace(i);
      if(cnt < 0) {
         cnt += 2;
         int t = heap.top();
         heap.pop();
         s[t] ^= '(' ^ ')';
         total += v[t];
      }
   }
   
   while(!heap.empty()) heap.pop();
   
   cnt = 0;
   for(int i = n; i > 0; i--) {
      if(s[i] == ')') cnt++;
      else cnt--, heap.emplace(i);
      if(cnt < 0) {
         cnt += 2;
         int t = heap.top();
         heap.pop();
         s[t] ^= '(' ^ ')';
         total += v[t];
      }
   }
   
   //cerr << s << '\n';
   
   return total;
}

signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
   n *= 2;
   vector<int> v(n + 1);
   for(auto &x : v | views::drop(1)) cin >> x;
   
   string s;
   cin >> s;
   s = "$" + s;
   
   int ans = mk_query(v, s);
   cout << ans << '\n';
   
   for(int i = 0, p, x; i < q; i++) {
      cin >> p >> x;
      if(v[p] == x);
      else v[p] = x, ans = mk_query(v, s);
      cout << ans << '\n';
   }
   
}

/**
  Anul asta nu se da centroid
  -- Rugaciunile mele
*/