#include<set>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>

using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}

int N, Q;
int A[200011], B[200011];
multiset<int> L, R;
LL sum, sumL, sumR;

void add(LL x) {
    if (x < 0) {
	L.insert(x);
	sumL += x;
    } else {
	R.insert(x);
	sumR += x;
    }
}

void del(LL x) {
    if (x < 0) {
	L.erase(L.find(x));
	sumL -= x;
    } else {
	R.erase(R.find(x));
	sumR -= x;
    }
}

void MAIN() {
    scanf("%d%d", &N, &Q);
    REP (i, N*2) scanf("%d", A+i);
    REP (i, N*2) scanf("%d", B+i);

    for (int i=1; i+1<N*2; i++) {
	add(B[i] - A[i]);
    }

    REP (i, N*2) sum += A[i];

    REP ($, Q) {
	int p, x, y;
	scanf("%d%d%d", &p, &x, &y);
	p--;
	sum -= A[p];
	if (0 < p && p < N*2-1) {
	    del(B[p] - A[p]);
	}
	A[p] = x;
	B[p] = y;
	if (0 < p && p < N*2-1) {
	    add(B[p] - A[p]);
	}
	sum += A[p];

	LL ans = sum;

	if (R.size() & 1) {
	    amax(ans, sum + sumR - *R.begin());
	    amax(ans, sum + sumR + *L.rbegin());
	} else {
	    amax(ans, sum + sumR);
	}

	printf("%lld\n", ans);
    }

}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}

