#include <bits/stdc++.h>

#define maxn 50005
#define ll long long

using namespace std;

int n, m, Q;

struct node{
	int x, y;
	node operator +(node b) {
		return {x + b.x, y + b.y};
	}
	node operator -(node b) {
		return {x - b.x, y - b.y};
	}
	ll operator *(node b) {
		return 1ll * x * b.y - 1ll * y * b.x;
	}
};

int tot;
node tmp[maxn];
int top;
node stk[maxn];
vector<node> cv[maxn];
vector<pair<int, int> > g[maxn];

struct qR{
	int a, b, id;
};
vector<qR> q[maxn];

ll ans[maxn];

void conv(vector<node> &a, vector<node> &b) {
	int ia = 0, ib = 0;
	tot = 0;
	while (ia < (int)a.size() && ib < (int)b.size()) {
		if ((a[ia].x == b[ib].x && a[ia].y < b[ib].y) || a[ia].x < b[ib].x) tmp[++tot] = a[ia++];
		else tmp[++tot] = b[ib++];
	}
	while (ia < (int)a.size()) tmp[++tot] = a[ia++];
	while (ib < (int)b.size()) tmp[++tot] = b[ib++];
	a.clear();
	top = 0;
	for (int i = 1; i <= tot; i++) {
		if (top > 1 && (stk[top] - stk[top - 1]) * (tmp[i] - stk[top]) <= 0) --top;
		stk[++top] = tmp[i];
	}
	for (int i = 1; i <= top; i++) a.push_back(stk[i]);
}

int main() {
//	freopen("dt.in", "r", stdin);
//	freopen("dt.out", "w", stdout);
	memset(ans, 0x3f, sizeof ans);
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		g[y].push_back({x, z});
	}
	scanf("%d", &Q);
	for (int i = 1; i <= Q; i++) {
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		q[z].push_back({x, y, i});
	}
	cv[1].push_back({0, 0});
	
	for (int i = 1; i <= n; i++) {
		if (i - 1002 > 0) {
			vector<node>().swap(cv[i - 1002]);
		}
		for (auto p : g[i]) {
			auto tmp = cv[p.first];
			for (auto &x : tmp) {
				if (p.second == 0) ++x.x;
				else ++x.y;
			}
			conv(cv[i], tmp);
		}
//		for (auto x : cv[i]) {
//			cout<<x.x<<","<<x.y<<" ";
//		}
//		puts("");
		for (auto p : q[i]) {
			for (auto x : cv[i]) {
				ans[p.id] = min(ans[p.id], 1ll * p.a * x.x + 1ll * p.b * x.y);
			}
		}
	}
	for (int i = 1; i <= Q; i++) printf("%lld\n", ans[i]);
	return 0;
}