#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<59;
const double pi=acos(-1);
const double eps=1e-7;
const ll mod=1e5;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

int n,q;
vl a,b;

int main(){
	cin>>n>>q;
	n*=2;
	a=b=vl(n);
	for(int i=0;i<n;i++) cin>>a[i];
	for(int i=0;i<n;i++) cin>>b[i];
	ll sum=0,tmp=0;
	multiset<ll> st1,st2;
	for(int i=1;i<n-1;i++){
		ll t=a[i]-b[i];
		tmp+=b[i];
		if(t>0){
			st1.insert(t);
			sum+=t;
		}
		else st2.insert(t);
	}
	for(int i=0;i<q;i++){
		ll p,x,y;
		cin>>p>>x>>y;
		p--;
		if(0<p&&p<n-1){
			ll t=a[p]-b[p];
			if(t>0){
				st1.erase(st1.lower_bound(t));
				sum-=t;
			}
			else st2.erase(st2.lower_bound(t));
			tmp+=y-b[p];
			t=x-y;
			if(t>0){
				st1.insert(t);
				sum+=t;
			}
			else st2.insert(t);
		}
		a[p]=x;b[p]=y;
		if(st1.size()%2==0) cout<<sum+tmp+a[0]+a[n-1]<<endl;
		else{
			cout<<max(-*st1.begin(),(st2.empty()?-INF:*(--st2.end())))+sum+tmp+a[0]+a[n-1]<<endl;
		}
	}
}