#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
	int x = 0, f = 1, c = getchar();
	for (; !isdigit(c); c = getchar())
		if (c == '-')
			f = -1;
	for (;  isdigit(c); c = getchar())
		x = x * 10 + c - '0';
	return x * f;
}

const int MAXN = 200005;

LL val_a[MAXN << 2], val_b[MAXN << 2];
int n, m, a[MAXN], b[MAXN];

inline void Build(int x, int l, int r)
{
	if (l == r)
		return (void)(val_a[x] = a[l], val_b[x] = b[l]);
	int mid = l + r >> 1;
	Build(x << 1, l, mid), Build(x << 1 | 1, mid + 1, r);
	val_a[x] = max(val_a[x << 1] + val_a[x << 1 | 1], val_b[x << 1] + val_b[x << 1 | 1]);
	val_b[x] = max(val_b[x << 1] + val_a[x << 1 | 1], val_a[x << 1] + val_b[x << 1 | 1]);
}

inline void Modify(int x, int l, int r, int p)
{
	if (l == r)
		return (void)(val_a[x] = a[l], val_b[x] = b[l]);
	int mid = l + r >> 1;
	if (p <= mid)
		Modify(x << 1, l, mid, p);
	else
		Modify(x << 1 | 1, mid + 1, r, p);
	val_a[x] = max(val_a[x << 1] + val_a[x << 1 | 1], val_b[x << 1] + val_b[x << 1 | 1]);
	val_b[x] = max(val_b[x << 1] + val_a[x << 1 | 1], val_a[x << 1] + val_b[x << 1 | 1]);
}

int main()
{
#ifdef wxh010910
	freopen("data.in", "r", stdin);
#endif
	n = Read(), m = Read();
	for (int i = 1; i <= n << 1; i ++)
		a[i] = Read();
	for (int i = 1; i <= n << 1; i ++)
		b[i] = Read();
	if (n == 1)
	{
		while (m --)
		{
			int p = Read(), x = Read(), y = Read();
			a[p] = x, b[p] = y;
			printf("%d\n", a[1] + a[n << 1]);
		}
		return 0;
	}
	Build(1, 2, (n << 1) - 1);
	while (m --)
	{
		int p = Read(), x = Read(), y = Read();
		a[p] = x, b[p] = y;
		if (p > 1 && p < n << 1)
			Modify(1, 2, (n << 1) - 1, p);
		printf("%lld\n", a[1] + a[n << 1] + val_a[1]);
	}
	return 0;
}
