#include "bits/stdc++.h"
using namespace std;
const long long mod = 1000000007;
const int maxn = 222222;
long long a[maxn], b[maxn];
long long tr[2][maxn<<2];
int n;
void modify(int id, int l, int r, int x, int aa, int bb){
    if(l == r){
        if(l == 1 || l == n){
            tr[0][id] = aa;
            tr[1][id] = -(1ll<<60);
        } else {
            tr[0][id] = aa;
            tr[1][id] = bb;
        }
    } else {
        int mid = (l + r)>>1;
        if(x <= mid) modify(id<<1, l, mid, x, aa, bb);
        else modify(id<<1|1, mid + 1, r, x, aa, bb);
        tr[0][id] = max(tr[0][id<<1] + tr[0][id<<1|1], tr[1][id<<1] + tr[1][id<<1|1]);
        tr[1][id] = max(tr[1][id<<1] + tr[0][id<<1|1], tr[0][id<<1] + tr[1][id<<1|1]);
    }
}
int main(){
    int q;
    scanf("%d %d", &n, &q);
    n *= 2;
    for(int e = 1; e <= n; e++){
        scanf("%lld", a + e);
    }
    for(int e = 1; e <= n; e++){
        scanf("%lld", b + e);
    }
    for(int e = 1; e <= n; e++){
        modify(1, 1, n, e, a[e], b[e]);
    }
    while(q--){
        int x, aa, bb;
        scanf("%d %d %d", &x, &aa, &bb);
        modify(1, 1, n, x, aa, bb);
        printf("%lld\n", tr[0][1]);
    }
	return 0;
}
