#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) x.begin(),x.end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popcount(x) (__builtin_popcount((x)))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e3+23,M = 55;
int n,Q;
int a[N];
char s[N];
ll f[N][M];
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   Solve();
}
void Solve() {
   cin>>n>>Q,n<<=1;
   for(int i=1;i<=n;i++) cin>>a[i];
   for(int i=1;i<=n;i++) cin>>s[i];
   memset(f,0x3f,sizeof f);
   f[0][0]=0;
   for(int i=1;i<=n;i++) for(int j=0;j<=50;j++)
      f[i][j]=min((j>0?f[i-1][j-1]+(s[i]=='('?0:a[i]):INF)
       ,(j<n?f[i-1][j+1]+(s[i]==')'?0:a[i]):INF));
   printf("%lld\n",f[n][0]);
   while(Q--) {
      int x,y; cin>>x>>y;
      a[x]=y;
      for(int i=1;i<=n;i++) for(int j=0;j<=50;j++)
         f[i][j]=min((j>0?f[i-1][j-1]+(s[i]=='('?0:a[i]):INF)
          ,(j<n?f[i-1][j+1]+(s[i]==')'?0:a[i]):INF));
      printf("%lld\n",f[n][0]);
   }
}