/*

_/      _/       _/_/_/      _/      _/    _/           _/_/_/_/_/
 _/    _/      _/      _/     _/    _/     _/           _/
  _/  _/      _/               _/  _/      _/           _/
   _/_/       _/                 _/        _/           _/_/_/_/
  _/  _/      _/                 _/        _/           _/
 _/    _/      _/      _/        _/        _/           _/
_/      _/       _/_/_/          _/        _/_/_/_/_/   _/_/_/_/_/

*/
#include <bits/stdc++.h>
#define ll long long
#define lc(x) ((x) << 1)
#define rc(x) ((x) << 1 | 1)
#define ru(i, l, r) for (int i = (l); i <= (r); i++)
#define rd(i, r, l) for (int i = (r); i >= (l); i--)
#define mid ((l + r) >> 1)
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define sz(s) (int)s.size()
#define maxn 50005
using namespace std;
int read() {
	int x = 0, w = 0; char ch = getchar();
	while(!isdigit(ch)) w |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return w ? -x : x;
}
int n, m;
vector<pii> G[maxn], pt[maxn];
int chk(pii a, pii b, pii c) {
	return (ll)(b.fi - a.fi) * (c.se - b.se) >= (ll)(b.se - a.se) * (c.fi - b.fi);
}
int main() {
	n = read(), m = read();
	ru(i, 1, m) {
		int x = read(), y = read(), c = read();
		G[x].push_back(mp(y, c));
	}
	pt[1].push_back(mp(0, 0));
	ru(i, 1, n) {
		vector<pii> tmp = pt[i]; pt[i].clear();
		sort(tmp.begin(), tmp.end());
		for (auto x: tmp) {
			while(pt[i].size() > 2 && chk(pt[i][pt[i].size() - 2], pt[i].back(), x)) pt[i].pop_back();
			pt[i].push_back(x); 
		}
		for (auto V: G[i]) for (auto x: pt[i]) {
			pt[V.fi].push_back(mp(x.fi + 1 - V.se, x.se + V.se));
		}
	}
	int q = read();
	while(q--) {
		int a = read(), b = read(), i = read(); ll ans = 1e18;
		for (auto x: pt[i]) ans = min(ans, (ll)a * x.fi + (ll)b * x.se);
		printf("%lld\n", ans);
	}
	return 0;
}