#include "bits/stdc++.h"
using namespace std;
#define ll long long
const int M = 5e7 + 5 , Len = 1e5 + 5;
const ll Inf = 1e12;
struct node
{
	int x,y;
	node(){x = y = 0;}
	node(int X,int Y){x = X , y = Y;}
	bool operator < (const node &Ano) const
	{return x < Ano.x || (x == Ano.x && y < Ano.y);}
	ll operator ^ (const node &Ano) const
	{return x * Ano.y - y * Ano.x;}
	node operator - (const node &Ano) const
	{return node(x - Ano.x , y - Ano.y);}
}stk[M];int top;
vector<node> vc[Len];
int head[Len],cnt,n,m,q;
struct Node
{
	int next,to,w;
}edge[Len << 1];
inline void add(int from,int to,int w)
{
	edge[++ cnt].to = to;
	edge[cnt].w = w;
	edge[cnt].next = head[from];
	head[from] = cnt;
}
int main()
{
	scanf("%d %d",&n,&m);
	for(int i = 1 ; i <= m ; i ++){int u,v,w;scanf("%d %d %d",&u,&v,&w);add(u , v , w);}
	vc[1].push_back(node(0 , 0));
	for(int i = 1 ; i <= n ; i ++)
	{
		sort(vc[i].begin() , vc[i].end());top = 0;const int SZ = (int)vc[i].size();
		for(int j = 0 ; j < SZ ; j ++)
		{
			while(top > 1 && ((stk[top] - stk[top - 1]) ^ (vc[i][j] - stk[top - 1])) >= 0) top --;
			stk[++ top] = vc[i][j]; 
		}
		vector<node> pw;swap(pw , vc[i]);vc[i].reserve(top);
		for(int j = 0 ; j < top ; j ++) vc[i].push_back(stk[j + 1]);
		for(int e = head[i] ; e ; e = edge[e].next)
		{
			int to = edge[e].to;
			for(int j = 1 ; j <= top ; j ++) vc[to].push_back(node(stk[j].x + (edge[e].w == 0) , stk[j].y + (edge[e].w == 1)));
		}
	}	scanf("%d",&q);
	for(int i = 1 ; i <= q ; i ++)
	{
		int a,b,x;scanf("%d %d %d",&a,&b,&x);
		const int SZ = (int)vc[x].size();ll as = Inf;
		for(int j = 0 ; j < SZ ; j ++) as = min(as , 1ll * a * vc[x][j].x + 1ll * b * vc[x][j].y);
		printf("%lld\n",as);
	}
	return 0;
}