#include <iostream>
#include <vector>
#include <atcoder/fenwicktree>

int main() {
    int N, M;
    std::cin >> N >> M;
    int64_t total_rating = 0, total_diff = 0;
    atcoder::fenwick_tree<int64_t> count(M + 1), rating(M + 1);
    std::vector<int> home(N), A(N), L(N), R(N);
    for (int i = 0; i < N; i++) {
        std::cin >> A[i] >> L[i] >> R[i];
        L[i]--;
        total_rating += A[i] * int64_t(R[i] - L[i]);
        home[i] = i;
        count.add(L[i], 1);
        count.add(R[i], -1);
        rating.add(i, A[i]);
    }
    for (int i = 0; i < N; i++) {
        total_diff += A[i] * count.sum(0, home[i] + 1);
    }

    int Q;
    std::cin >> Q;
    while (Q--) {
        int X, Y, U, V;
        std::cin >> X >> Y >> U >> V;
        X--, Y--, U--;
        total_rating -= A[X] * int64_t(R[X] - L[X]);
        total_diff -= A[X] * count.sum(0, home[X] + 1);
        rating.add(home[X], -A[X]);
        total_diff -= rating.sum(L[X], R[X]);
        total_diff += rating.sum(U, V);
        rating.add(Y, A[X]);
        count.add(L[X], -1);
        count.add(R[X], 1);
        home[X] = Y;
        L[X] = U;
        R[X] = V;
        count.add(U, 1);
        count.add(V, -1);
        total_rating += A[X] * int64_t(V - U);
        total_diff += A[X] * count.sum(0, Y + 1);
        std::cout << total_rating - total_diff << std::endl;
    }
}