/**
	author:  shobonvip
	created: 2025.09.07 09:11:53
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, m;
	cin >> n >> m;

	vector<ll> a(n), l(n), r(n), place(n);
	rep(i,0,n) {
		cin >> a[i] >> l[i] >> r[i];
		l[i]--;
		place[i] = i;
	}

	fenwick_tree<ll> ie_sum(m);
	fenwick_tree<ll> kukan_sum(m+1);

	rep(i,0,n) {
		ie_sum.add(i, a[i]);
	}

	rep(i,0,n) {
		kukan_sum.add(l[i],1);
		kukan_sum.add(r[i],-1);
	}

	ll ans = 0;
	rep(i,0,n) {
		ans += a[i] * (r[i] - l[i]);
		ans -= ie_sum.sum(l[i], r[i]);
	}

	int q; cin >> q;

	while(q--) {
		int i, y, u, v;
		cin >> i >> y >> u >> v;
		i--;y--;u--;

		ans -= a[i] * (r[i] - l[i]);
		ans += ie_sum.sum(l[i],r[i]);

		kukan_sum.add(l[i],-1);
		kukan_sum.add(r[i],+1);

		ans += a[i] * kukan_sum.sum(0,place[i]+1);

		ie_sum.add(place[i], -a[i]);

		place[i] = y;

		ie_sum.add(place[i], +a[i]);

		ans -= a[i] * kukan_sum.sum(0,place[i]+1);

		l[i]=u;
		r[i]=v;

		kukan_sum.add(l[i],+1);
		kukan_sum.add(r[i],-1);

		ans += a[i] * (r[i] - l[i]);
		ans -= ie_sum.sum(l[i],r[i]);

		cout << ans << '\n';
	}

}