#include<bits/stdc++.h>
#define rep(i,a,b) for (register int i=(a);i<=(b);i++)
#define drep(i,a,b) for (register int i=(a);i>=(b);i--)
typedef long long ll;
using namespace std;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
	
	int n,m; cin>>n>>m;
	vector<vector<array<int,2> > > G(n+1);
	rep(i,1,m)
	{
		int u,v,w; cin>>u>>v>>w;
		G[v].push_back({u,w});
	}
	
	vector<vector<array<int,2> > > vec(n+1);
	vec[1].push_back({0,0});
	rep(i,2,n)
	{
		vector<array<int,2> > now;
		for (auto v:G[i]) for (auto x:vec[v[0]])
		{
			if (v[1]==0) now.push_back({x[0]+1,x[1]});
			else now.push_back({x[0],x[1]+1});
		}
		sort(now.begin(),now.end());
		vector<array<int,2> > stk;
		
		int mn=2e9;
		for (auto x:now)
		{
			if (stk.size()&&x[0]==stk.back()[0]&&x[1]>=stk.back()[1]) continue;
			while (stk.size()>1)
			{
				auto a=stk[stk.size()-2],b=stk.back();
				array<int,2> u={x[0]-a[0],x[1]-a[1]};
				array<int,2> v={b[0]-a[0],b[1]-a[1]};
				if (1ll*u[0]*v[1]-1ll*u[1]*v[0]>=0)
				{
					stk.pop_back();
				}
			}
			stk.push_back(x);
		}
		vec[i]=stk;
	}
	
//	rep(i,1,n)
//	{
//		printf("vec %d : ",i);
//		for (auto x:vec[i]) printf("(%d,%d) ",x[0],x[1]);
//		printf("\n");
//	}
	
	int q; cin>>q;
	rep(_,1,q)
	{
		int a,b,x; cin>>a>>b>>x;
		int l=0,r=vec[x].size()-1;
		while (r-l>3)
		{
			int m1=(l+l+r)/3,m2=(l+r+r)/3;
			ll v1=1ll*a*vec[x][m1][0]+1ll*b*vec[x][m1][1];
			ll v2=1ll*a*vec[x][m2][0]+1ll*b*vec[x][m2][1];
			if (v2>=v1) r=m2;
			else l=m1;
		}
		ll ans=1e18;
		rep(i,l,r) ans=min(ans,1ll*a*vec[x][i][0]+1ll*b*vec[x][i][1]);
		printf("%lld\n",ans);
	}
	
	return 0;
}