#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using P = pair<ll, int>;

ll calc(ll base, ll sum, set<P>& s, set<P>& s2) {
    ll v1 = base + sum;
    if (s.size() % 2 == 0 || s2.empty()) return v1;
    v1 -= s.begin()->first;
    
    ll v2 = base + sum - s2.begin()->first;
    return max(v1, v2);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    int m = 2 * n;
    vector<ll> a(m), b(m);
    for (int i = 0; i < m; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];

    vector<int> p(q);
    vector<ll> x(q), y(q);
    for (int i = 0; i < q; i++) {
        cin >> p[i] >> x[i] >> y[i];
        p[i]--;
    }

    ll base = 0;
    ll sum = 0;
    set<P> s, s2;
    for (int i = 0; i < m; i++) {
        base += a[i];
        if (i > 0 && i < m - 1) {
            if (a[i] <= b[i]) {
                sum += b[i] - a[i];
                s.emplace(b[i] - a[i], i);
            } else {
                s2.emplace(-b[i] + a[i], i);
            }
        }
    }

    for (int i = 0; i < q; i++) {
        base += x[i] - a[p[i]];
        if (p[i] == 0 || p[i] == m - 1) {
            cout << calc(base, sum, s, s2) << endl;
        } else {
            if (b[p[i]] >= a[p[i]]) {
                s.erase(P(b[p[i]] - a[p[i]], p[i]));
                sum -= b[p[i]] - a[p[i]];
            } else{
                s2.erase(P(-b[p[i]] + a[p[i]], p[i]));
            }
            if (y[i] >= x[i]) {
                s.emplace(y[i] - x[i], p[i]);
                sum += y[i] - x[i]; 
            } else {
                s2.emplace(-y[i] + x[i], p[i]);
            }
            cout << calc(base, sum, s, s2) << endl;
        }
        a[p[i]] = x[i];
        b[p[i]] = y[i];
    }
    return 0;
}