#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll MOD = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
const int MAX_N = (1 << 18);
int t; ll dat[2 * MAX_N - 1][2];
int n;
void init() {
	t = 1;
	while(t < 2*n)t *= 2;
	rep(i, 2 * t - 1) {
		rep(j, 2) {
			dat[i][j] = -INF;
		}
	}
}
void update(int k, int j, ll a) {
	k += t - 1;
	dat[k][j] = a;
	while (k > 0) {
		k = (k - 1) / 2;
		int le = k * 2 + 1; int ri = k * 2 + 2;
		if (dat[ri][0] != -INF || dat[ri][1] != -INF) {
			dat[k][0] = max(dat[le][0] + dat[ri][0], dat[le][1] + dat[ri][1]);
			dat[k][1] = max(dat[le][0] + dat[ri][1], dat[le][1] + dat[ri][0]);
		}
		else {
			dat[k][0] = dat[le][0];
			dat[k][1] = dat[le][1];
		}
	}
}
int main(){
	int q; cin >> n >> q; init();
	rep(i, 2 * n) {
		int a; cin >> a;
		update(i, 0, a);
	}
	rep(i, 2 * n) {
		int b; cin >> b;
		if (i > 0 && i < 2 * n - 1) {
			update(i, 1, b);
		}
	}
	rep(i, q) {
		int p; ll x, y; cin >> p >> x >> y; p--;
		update(p, 0, x);
		if (p > 0 && p < 2 * n - 1) {
			update(p, 1, y);
		}
		cout << dat[0][0] << endl;
	}
	return 0;
}