#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, int> pli;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 100010;

int main(){
    int n, q;
    scanf("%d%d", &n, &q);
    lint a[2*n], b[2*n];
    rep(i, 2*n) scanf("%lld", &a[i]);
    rep(i, 2*n) scanf("%lld", &b[i]);
    int cnt = 2;
    lint sum = a[0] + a[2*n-1];
    set<pli> S;
    For(i, 1, 2*n-1){
        if(a[i] >= b[i]){
            sum += a[i];
            ++cnt;
        }
        else sum += b[i];
        S.emplace(abs(a[i]-b[i]), i);
    }

    rep(_, q){
        int p;
        lint x, y;
        scanf("%d%lld%lld", &p, &x, &y);
        --p;
        if(p == 0 || p == 2*n-1){
            sum -= a[p];
            sum += x;
        }
        else{
            S.erase({abs(a[p]-b[p]), p});
            S.insert({abs(x-y), p});
            sum -= (a[p]>=b[p] ? a[p] : b[p]);
            if(x >= y){
                sum += x;
                if(a[p] < b[p]) ++cnt;
            }
            else{
                sum += y;
                if(a[p] >= b[p]) --cnt;
            }
        }
        a[p] = x; b[p] = y;
        printf("%lld\n", cnt % 2 == 0 ? sum : sum-S.begin()->fi);
    }
}