#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int op (int a, int b) {
    return a + b;
}
int e () {
    return 0;
}
int mapping (int a, int b) {
    return a + b;
}
int composition (int a, int b) {
    return a + b;
}
int id () {
    return 0;
}
int main() {
    int N, M;
    cin >> N >> M;
    vector<int> A(N);
    vector<int> L(N);
    vector<int> R(N);
    for (int i = 0; i < N; ++i) cin >> A[i] >> L[i] >> R[i];
    for (int i = 0; i < N; ++i) {
        L[i]--; R[i]--;
    }
    lazy_segtree<int, op, e, int, mapping, composition, id> seg(M);
    segtree<int, op, e> seg2(M);
    for (int i = 0; i < N; ++i) {
        seg.apply(L[i], R[i] + 1, 1);
    }
    long long ans = 0;
    for (int i = 0; i < N; ++i) {
        ans += 1LL * (R[i] - L[i] + 1) * A[i];
        ans -= 1LL * A[i] * seg.get(i);
    }
    for (int i = 0; i < N; ++i) {
        seg2.set(i, A[i]);
    }
    vector<int> H(N);
    for (int i = 0; i < N; ++i) H[i] = i;
    int Q;
    cin >> Q;
    for (;Q--;) {
        int X, Y, U, V;
        cin >> X >> Y >> U >> V;
        X--; Y--; U--; V--;
        ans += 1LL * seg.prod(H[X], H[X] + 1) * A[X];
        seg2.set(H[X], 0);
        ans -= 1LL * (R[X] - L[X] + 1) * A[X];
        ans += seg2.prod(L[X], R[X] + 1);
        seg.apply(L[X], R[X] + 1, -1);


        L[X] = U;
        R[X] = V;
        H[X] = Y;
        seg.apply(L[X], R[X] + 1, 1);
        ans -= seg2.prod(L[X], R[X] + 1);
        ans += 1LL * (R[X] - L[X] + 1) * A[X];
        seg2.set(H[X], A[X]);
        ans -= 1LL * seg.prod(H[X], H[X] + 1) * A[X];
        cout << ans << endl;
    }
}