#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;

void solve() {
    ll N,M;
    cin>>N>>M;
    vector<ll> A(M);
    vector<ll> H(N);
    vector<pair<ll,ll>> L(N);
    rep(i,N){
        cin>>A[i];
        ll l,r;
        cin>>l>>r;
        l--;
        L[i]={l,r};
        H[i]=i;
    }
    auto op=[](ll x,ll y)->ll {
        return x+y;
    };
    auto e=[]()->ll {
        return 0LL;
    };
    segtree<ll,op,e> STA(A),STS(M+1);
    ll ans=0;
    rep(i,N){
        auto [l,r]=L[i];
        ans+=A[i]*(r-l)-STA.prod(l,r);
        STS.set(l,STS.get(l)+1);
        STS.set(r,STS.get(r)-1);
    }
    ll Q;
    cin>>Q;
    rep(_,Q){
        ll x,y,u,v;
        cin>>x>>y>>u>>v;
        u--;
        x--;
        y--;
        auto [l,r]=L[x];
        ans-=A[x]*(r-l);
        ans+=STA.prod(l,r);
        STS.set(l,STS.get(l)-1);
        STS.set(r,STS.get(r)+1);
        STA.set(H[x],0);
        ll s=STS.prod(0,H[x]+1);
        ans+=A[x]*s;

        H[x]=y;
        L[x]={u,v};
        s=STS.prod(0,y+1);
        ans-=A[x]*s;
        STA.set(y,A[x]);
        STS.set(u,STS.get(u)+1);
        STS.set(v,STS.get(v)-1);
        ans+=A[x]*(v-u);
        ans-=STA.prod(u,v);

        cout<<ans<<endl;
    }
    return;
}


int main() {
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}