#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,q,a[200005],pos,vis[200005];char s[200005];
priority_queue<int,vector<int>,greater<int> >pq;
ll calc(){
	while(pq.size())pq.pop();
	ll ans=0;
	for(int i=1;i<=pos;++i){
		if(s[i]==')')pq.push(a[i]);
		if(vis[i])ans+=1ll*pq.top(),pq.pop();
	}
	while(pq.size())pq.pop();
	for(int i=(n<<1);i>pos;--i){
		if(s[i]=='(')pq.push(a[i]);
		if(vis[i])ans+=1ll*pq.top(),pq.pop();
	}return ans;
}
int main(){
	cin>>n>>q;
	for(int i=1;i<=(n<<1);++i)scanf("%d",&a[i]);
	scanf("%s",s+1);int sum=0,mn=0;
	for(int i=1;i<=(n<<1);++i){
		if(s[i]=='(')++sum;else --sum;
		if(sum<=mn)pos=i,mn=sum;
	}sum=0;
	for(int i=1;i<=pos;++i){
		if(s[i]=='(')++sum;
		else{
			if(!sum)vis[i]=1,sum=1;
			else --sum;
		}
	}sum=0;
	for(int i=(n<<1);i>pos;--i){
		if(s[i]==')')++sum;
		else{
			if(!sum)vis[i]=1,sum=1;
			else --sum;
		}
	}
	printf("%lld\n",calc());
	while(q--){
		int p,x;scanf("%d%d",&p,&x),a[p]=x;
		printf("%lld\n",calc());
	}
	return 0;
}