#include<iostream>
#include<cstdio>
#include<vector>
#include<cassert>
#define N 100000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int num,data;
};
struct points
{
    int x,y;
    bool operator < (const points &t)const
    {
	return x!=t.x?x<t.x:y<t.y;    
    }
};
points operator - (points a,points b)
{
    return (points){a.x-b.x,a.y-b.y};
}
long long operator * (points a,points b)
{
    return 1ll*a.x*b.y-1ll*a.y*b.x;
}
int n,m,q,lg[N+1];
vector<reads>E[N+1];
vector<points>dp[N+1];
bool check(points a,points b,points c)
{
    return (c-a)*(b-a)>=0;
}
vector<points>merge(vector<points>A,vector<points>B)
{
    vector<points>C;
    vector<points>D;
    int ps=0,ps2=0;
    while (ps<A.size()||ps2<B.size())
    {
	if (ps<A.size()&&(ps2==B.size()||A[ps]<B[ps2])) C.push_back(A[ps]),ps++;
	else C.push_back(B[ps2]),ps2++;
    }
    for (int i=0;i<C.size();++i)
    {
	if (D.size()>=2&&check(D[(int)(D.size())-2],D.back(),C[i])) D.pop_back();
	D.push_back(C[i]);
    }
    return D;
}
int main()
{
    int a,b,x,y,z,d;
    vector<points>p;
    n=read(),m=read();
    for (int i=2;i<=n;++i) lg[i]=lg[i>>1]+1;
    for (int i=1;i<=m;++i) x=read(),y=read(),z=read(),E[y].push_back((reads){x,z});
    dp[1].push_back((points){0,0});
    for (int i=2;i<=n;++i)
    {
	for (int j=0;j<E[i].size();++j)
	{
	    p=dp[E[i][j].num];
	    if (!E[i][j].data)
	    {
		for (int k=0;k<p.size();++k) p[k].x++;
	    }
	    else
	    {
		for (int k=0;k<p.size();++k) p[k].y++;
	    }
	    dp[i]=merge(dp[i],p);
	}
	for (int j=1;j<dp[i].size();++j) assert(dp[i][j-1]<dp[i][j]);
    }
    q=read();
    while (q--)
    {
	a=read(),b=read(),x=read(),d=0;
	for (int i=lg[dp[x].size()];i>=0;--i)
	    if (d+(1<<i)<dp[x].size()&&1ll*a*dp[x][d+(1<<i)].x+1ll*b*dp[x][d+(1<<i)].y<1ll*a*dp[x][d+(1<<i)-1].x+1ll*b*dp[x][d+(1<<i)-1].y)
		d+=(1<<i);
	printf("%lld\n",1ll*a*dp[x][d].x+1ll*b*dp[x][d].y);
    }
    return 0;
}