#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


struct ST {
    struct Node {
        int l, r;
        ll sum, flag, v;
    };
    vector<Node> tr;

    ST(ST&& other) noexcept : tr(move(other.tr)) { }
    ST (int l, int r) : tr(vector<Node>(((r - l) << 2) + 10)) { build(1, l, r); }

    ST& operator=(ST&& other) noexcept {
        if (this != &other) {
            tr = move(other.tr);
        }
        return *this;
    }

private:
    void pushup(int u) { tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum, tr[u].v = tr[u << 1].v + tr[u << 1 | 1].v; }
    void pushdown(Node& u, Node& l, Node& r) {
        l.flag += u.flag, r.flag += u.flag;
        l.sum += u.flag * (l.r - l.l + 1), r.sum += u.flag * (r.r - r.l + 1);
        u.flag = 0;
    }
    void pushdown(int u) { if (tr[u].flag) pushdown(tr[u], tr[u << 1], tr[u << 1 | 1]); }

    void build(int u, int l, int r) {
        tr[u] = {l, r};
        if (l == r) return;
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }

public:
    ll query(int u, int l, int r) {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        ll res = 0;
        if (l <= mid) res += query(u << 1, l, r);
        if (r > mid) res += query(u << 1 | 1, l, r);
        return res;
    }

    ll query2(int u, int l, int r) {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u].v;
        int mid = tr[u].l + tr[u].r >> 1;
        ll res = 0;
        if (l <= mid) res += query2(u << 1, l, r);
        if (r > mid) res += query2(u << 1 | 1, l, r);
        return res;
    }

    void modify(int u, int x, int v) {
        if (tr[u].l == tr[u].r) tr[u].v = v;
        else {
            int mid = tr[u].l + tr[u].r >> 1;
            if (x <= mid) modify(u << 1, x, v);
            else modify(u << 1 | 1, x, v);
            pushup(u);
        }
    }

    void modify(int u, int l, int r, ll v) {
        if (tr[u].l >= l && tr[u].r <= r) tr[u].flag += v, tr[u].sum += (tr[u].r - tr[u].l + 1) * v;
        else {
            pushdown(u);
            int mid = tr[u].l + tr[u].r >> 1;
            if (l <= mid) modify(u << 1, l, r, v);
            if (r > mid) modify(u << 1 | 1, l, r, v);
            pushup(u);
        }
    }
};
int a[N], l[N], r[N], t[N];

int main() {
    cin >> n >> m;
    ST tr(1, m);
    for (int i = 1; i < n + 1; i++) scanf("%d%d%d", a + i, l + i, r + i), t[i] = i, tr.modify(1, i, a[i]), tr.modify(1, l[i], r[i], 1);
    for (int i = 1; i < n + 1; i++) res += (r[i] - l[i] + 1ll) * a[i] - tr.query2(1, l[i], r[i]);
    int k;
    scanf("%d", &k);
    while (k--) {
        int x, y, nl, nr;
        scanf("%d%d%d%d", &x, &y, &nl, &nr);
        res += tr.query2(1, l[x], r[x]) - a[x] * (r[x] - l[x] + 1ll);
        res += (tr.query(1, t[x], t[x]) - (l[x] <= t[x] && r[x] >= t[x])) * a[x];
        tr.modify(1, t[x], 0), tr.modify(1, l[x], r[x], -1);

        tr.modify(1, y, a[x]), tr.modify(1, nl, nr, 1);
        res += (nr - nl + 1ll) * a[x] - tr.query2(1, nl, nr);
        res += -(tr.query(1, y, y) - (nl <= y && nr >= y)) * a[x];
        t[x] = y, l[x] = nl, r[x] = nr;
        printf("%lld\n", res);
    }
    return 0;
}