#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;

int A[202020], B[202020];
multiset<int> p,m;

int main(){
  int N,Q; cin>>N>>Q;
  ll S=0;
  rep(i,2*N){
    cin>>A[i];
    S+=A[i];
  }

  ll T=0;
  rep(i,2*N){
    cin>>B[i];
    B[i]-=A[i];
    if(i!=0&&i!=2*N-1){
      if(B[i]>0){
        p.insert(B[i]);
        T+=B[i];
      }else{
        m.insert(-B[i]);
      }
    }
  }
  while(Q--){
    ll i,x,y; cin>>i>>x>>y; i--;
    S-=A[i];
    if(i!=0&&i!=2*N-1){
      if(B[i]>0){
        p.erase(p.find(B[i]));
        T-=B[i];
      }else{
        m.erase(m.find(-B[i]));
      }
    }

    A[i]=x;
    S+=A[i];
    B[i]=y-x;
    if(i!=0&&i!=2*N-1){
      if(B[i]>0){
        p.insert(B[i]);
        T+=B[i];
      }else{
        m.insert(-B[i]);
      }
    }

    ll ans;
    if(p.size()%2==0) ans=S+T;
    else ans=S+T-min(*p.begin(),*m.begin());
    cout<<ans<<endl;
  }
  return 0;
}
