#include<bits/stdc++.h>
#define FOR(i, n, m) for(int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using ld = long double;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-15;
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
	os << to_string(p.first) << " " << to_string(p.second);
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
	REP(i, v.size()) {
		if(i) os << " ";
		os << to_string(v[i]);
	}
	return os;
}

/*
template<typename T>
struct Treap {
	double drand() { // random number in [0, 1]
		static random_device rd;
		static mt19937 mt(rd());
		return (unsigned)mt() / (double)numeric_limits<unsigned>::max();
	}
	T v;
	double p;
	int cnt;
	Treap* lch;
	Treap* rch;
	Treap(T v) : v(v), p(drand()), cnt(1), lch(NULL), rch(NULL) { }
	Treap* update() {
		this->size = size(this->lch) + size(this->rch) + 1;
		return this;
	}
	static int size(Treap* t) {
		if(!t) return 0;
		else return t->cnt;
	}
	static Treap* merge(Treap* l, Treap* r) {
		if(!l || !r) {
			if(!l) return r;
			else return l;
		}
		if(l->p >= r->p) {
			l->rch = merge(l->rch, r);
			return l->update();
		} else {
			r->lch = merge(r->lch, l);
			return r->update();
		}
	}
	static pair<Treap*, Treap*> split(Treap* t, int k) {
		// split [0, k) and [k, n)
		if(k == 0) return {NULL, t};
		if(!(t->l)) {
			auto tmp = split(t->r, k - 1);
			t->r = tmp.first;
			return {t->update(), tmp.second};
		} else if(!(t->r)) {
			auto tmp = split(t->r, k - 1);
			t->r = tmp.first;
			return {t->update(), tmp.second};
		} else {

		}
	}
	Treap* insert() {
	}
	Treap* erase() {
	}
	T operator[](int k) {
	}
};
*/

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, q;
	cin >> n >> q;
	vector<ll> a(2 * n), b(2 * n);
	REP(i, 2 * n) cin >> a[i];
	REP(i, 2 * n) cin >> b[i];
	ll sum1 = 0, sum2 = 0;
	REP(i, 2 * n) sum1 += a[i];
	set<pair<ll, ll>> st1;
	set<pair<ll, ll>> st2;
	FOR(i, 1, 2 * n - 1) {
		if(b[i] - a[i] >= 0) {
			st1.insert({b[i] - a[i], i});
			sum2 += b[i] - a[i];
		} else {
			st2.insert({b[i] - a[i], i});
		}
	}
	st2.insert({-inf*inf, 0});
	REP(i, q) {
		ll p, x, y;
		cin >> p >> x >> y;
		p--;
		sum1 -= a[p]; sum1 += x;
		if(p != 0 && p != 2 * n - 1) {
			if(b[p] - a[p] >= 0) {
				st1.erase({b[p] - a[p], p});
				sum2 -= (b[p] - a[p]);
			} else {
				st2.erase({b[p] - a[p], p});
			}
			if(y - x >= 0) {
				st1.insert({y - x, p});
				sum2 += y - x;
			} else {
				st2.insert({y - x, p});
			}
		}
		a[p] = x; b[p] = y;
		if((int)st1.size() % 2 == 0) {
			cout << sum1 + sum2 << endl;
		} else {
			cout << max(sum1 + sum2 - st1.begin()->first,
						sum1 + sum2 + (--st2.end())->first) << endl;
		}
	}
	return 0;
}
// ---------------------------------------
