#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/segtree>
ll op(ll a, ll b){
    return a + b;
}
ll e(){
    return 0ll;
}

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, M;
    cin >> N >> M;
    vector<ll> A(N), L(N), R(N), p(N);
    rep(i, 0, N) cin >> A[i] >> L[i] >> R[i], L[i]--, p[i] = i;
    ll ans = 0;
    atcoder::segtree<ll, op, e> seg(M);
    atcoder::segtree<ll, op, e> seg2(M + 1);
    auto upd = [&](int ind, int x) -> void {
        seg2.set(ind, seg2.get(ind) + x);
    };
    rep(i, 0, N){
        seg.set(i, A[i]);
        upd(L[i], 1);
        upd(R[i], -1);
    }
    auto calc = [&](int ind) -> ll {
        ll res = A[ind] * seg2.prod(0, p[ind] + 1) + seg.prod(L[ind], R[ind]);
        if (L[ind] <= p[ind] && p[ind] < R[ind]) res -= A[ind];
        // cout << res << " ";
        res = A[ind] * (R[ind] - L[ind]) - res;
        // cout << res << "\n";
        return res;
    };
    rep(i, 0, N){
        ans += A[i] * (R[i] - L[i]);
        ans -= seg.prod(L[i], R[i]);
    }
    int Q;
    cin >> Q;
    while (Q--){
        ll x, y, u, v;
        cin >> x >> y >> u >> v;
        u--, x--, y--;
        ans -= calc(x);
        upd(L[x], -1);
        upd(R[x], 1);
        upd(u, 1);
        upd(v, -1);
        L[x] = u, R[x] = v;
        seg.set(p[x], e());
        p[x] = y;
        seg.set(p[x], A[x]);
        ans += calc(x);
        cout << ans << "\n";
    }
}