#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T>& v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>>& v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>>& v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T>& st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T>& ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T>& mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint>& vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>>& vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

struct S {
    ll value;
    ll size;
};

S op(S a, S b) { return S{a.value + b.value, a.size + b.size}; }

S e() { return S{0, 0}; }

S mapping(ll f, S x) { return S{x.value + f * x.size, x.size}; }

ll composition(ll f, ll g) { return f + g; }

ll id() { return 0LL; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N, M;
    cin >> N >> M;
    vector<ll> A(N);
    vector<ll> L(N);
    vector<ll> R(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i] >> L[i] >> R[i];
        L[i]--;
        R[i]--;
    }
    ll Q;
    cin >> Q;
    vector<ll> X(Q);
    vector<ll> Y(Q);
    vector<ll> U(Q);
    vector<ll> V(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> X[i] >> Y[i] >> U[i] >> V[i];
        X[i]--;
        Y[i]--;
        U[i]--;
        V[i]--;
    }

    // 区間更新区間和の遅延セグ木本
    lazy_segtree<S, op, e, ll, mapping, composition, id> seg1(M);
    lazy_segtree<S, op, e, ll, mapping, composition, id> seg2(M);
    lazy_segtree<S, op, e, ll, mapping, composition, id> seg3(M);

    for (ll i = 0; i < M; i++) {
        seg1.set(i, S{0, 1});
        seg3.set(i, S{0, 1});
    }

    for (ll i = 0; i < N; i++) {
        seg1.apply(L[i], R[i] + 1, 1);
        seg3.apply(i, i + 1, A[i]);
    }

    ll ans = 0;
    for (ll i = 0; i < N; i++) {
        ll cnt = R[i] - L[i] + 1;
        ll all_val = seg3.prod(L[i], R[i] + 1).value;
        ans += A[i] * cnt - all_val;
    }

    vector<ll> now_h(N, -1);
    vector<ll> now_L(N, -1);
    vector<ll> now_R(N, -1);
    for (ll i = 0; i < N; i++) {
        now_h[i] = i;
        now_L[i] = L[i];
        now_R[i] = R[i];
    }
    // debug(now_h);
    // debug(now_L);
    // debug(now_R);

    // debug(ans);
    for (ll i = 0; i < Q; i++) {
        // 古い影響を打ち消す
        seg1.apply(now_L[X[i]], now_R[X[i]] + 1, -1);

        ll cnt_old = now_R[X[i]] - now_L[X[i]] + 1;
        ll all_val_old = seg3.prod(now_L[X[i]], now_R[X[i]] + 1).value;

        // debug_out(cnt_old, all_val_old);

        ans -= (A[X[i]] * cnt_old - all_val_old);

        cnt_old = seg1.prod(now_h[X[i]], now_h[X[i]] + 1).value;
        // debug_out(cnt_old);

        ans += A[X[i]] * cnt_old;
        seg3.apply(now_h[X[i]], now_h[X[i]] + 1, -A[X[i]]);
        seg3.apply(Y[i], Y[i] + 1, A[X[i]]);

        // 新しい影響を加える
        ll cnt_new = V[i] - U[i] + 1;
        ll all_val_new = seg3.prod(U[i], V[i] + 1).value;

        // debug_out(cnt_new, all_val_new);

        ans += (A[X[i]] * cnt_new - all_val_new);

        cnt_new = seg1.prod(Y[i], Y[i] + 1).value;

        // debug_out(cnt_new);

        ans -= cnt_new * A[X[i]];

        seg1.apply(U[i], V[i] + 1, 1);

        now_h[X[i]] = Y[i];
        now_L[X[i]] = U[i];
        now_R[X[i]] = V[i];

        cout << ans << endl;
    }
}