#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,q;
    cin >> n >> q;
    ll res = 0, sm = 0;
    vl a(2*n),b(2*n);
    multiset<int> x,y;
    rep(i,2*n){
        cin >> a[i];
        res += a[i];
    }
    rep(i,2*n){
        cin >> b[i];
        b[i] -= a[i];
        if(i > 0 && i < 2*n-1){
            if(b[i] > 0){
                x.insert(b[i]);
                sm += b[i];
            }else{
                y.insert(-b[i]);
            }
        }
    }
    rep(i,q){
        int p,q,r;
        cin >> p >> q >> r;
        --p;
        res -= a[p];
        if(p > 0 && p < 2*n-1){
            if(b[p] > 0){
                x.erase(x.find(b[p]));
                sm -= b[p];
            }else{
                y.erase(y.find(-b[p]));
            }
        }
        a[p] = q;
        res += q;
        b[p] = r - q;
        if(p > 0 && p < 2*n-1){
            if(b[p] > 0){
                x.insert(b[p]);
                sm += b[p];
            }else{
                y.insert(-b[p]);
            }
        }
        ll ans = 0;
        if(len(x)%2){
            ans = res + max(sm-*x.begin(), sm-*y.begin());
        }else{
            ans = res+sm;
        }
        cout << ans << "\n";
    }
    return 0;
}
