#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, q;
    cin >> n >> q;
    n *= 2;
    vector<ll> a(n), b(n);
    REP(i, n) cin >> a[i];
    REP(i, n) cin >> b[i];

    ll suma = 0;
    REP(i, n) suma += a[i];

    ll sum = 0, cnt = 0;
    multiset<ll> st1, st2;
    FOR(i, 1, n-1) {
        if(b[i]-a[i] > 0) {
            sum += b[i]-a[i];
            cnt++;
            st1.insert(b[i]-a[i]);
        } else {
            st2.insert(b[i]-a[i]);
        }
    }
    // cout << sum << " " << cnt << " " << st1 << " " << st2 << endl;

    REP(i, q) {
        ll p, x, y;
        cin >> p >> x >> y; p--;

        if(0 < p && p < n-1) {
            if(b[p]-a[p] > 0) {
                sum -= b[p]-a[p];
                cnt--;
                auto itr = st1.find(b[p]-a[p]);
                st1.erase(itr);
            } else {
                auto itr = st2.find(b[p]-a[p]);
                st2.erase(itr);
            }
        }
        suma -= a[p];

        a[p] = x;
        b[p] = y;
        if(0 < p && p < n-1) {
            if(b[p]-a[p] > 0) {
                sum += b[p]-a[p];
                cnt++;
                st1.insert(b[p]-a[p]);
            } else {
                st2.insert(b[p]-a[p]);
            }
        }
        suma += a[p];

        if(cnt%2==0) cout << suma + sum << endl;
        else cout << max(suma + sum + *st2.begin(), suma + sum - *st1.begin()) << endl;
    }

    // ll n;
    // cin >> n;
    //
    // vector<ll> a;
    // REP(i, 1LL<<n) {
    //     bool flag = true;
    //     ll sum = 0;
    //     REP(j, n) {
    //         sum += (i&1LL<<j)?1:-1;
    //         if(sum < 0) {
    //             flag = false;
    //             break;
    //         }
    //     }
    //     if(sum != 0) flag = false;
    //     if(flag) a.push_back(i);
    // }
    // // cout << a << endl;
    //
    // ll m = a.size();
    // set<vector<ll>> st;
    // REP(i, m) FOR(j, i+1, m) {
    //     vector<ll> diff;
    //     REP(k, n) {
    //         if((a[i]&1LL<<k) != (a[j]&1LL<<k)) {
    //             diff.push_back(k);
    //         }
    //     }
    //     st.insert(diff);
    // }
    // cout << st << endl;

    return 0;
}
