#include <bits/stdc++.h>
#define eb emplace_back
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
using namespace std;

template<typename Tp>
void read(Tp &x) {
    x = 0; char ch = getchar(); int f = 0;
    for(; !isdigit(ch); f |= (ch == '-'), ch = getchar());
    for(; isdigit(ch); x = (x<<3)+(x<<1)+(ch^48), ch = getchar());
    if (f) x = ~x + 1;
}

typedef long long LL;
const LL inf = 9e18;
const int N = 1e5 + 5;
int n, m, deg[N];
vector<pii> G[N], vec[N];

double slope(pii i, pii j) {
    if (i.fi == j.fi) return inf;
    return 1.0 * (i.se - j.se) / (i.fi - j.fi);
}
pii operator + (const pii &a, const pii &b) {return mp(a.fi + b.fi, a.se + b.se);}

void TopuSort() {
    queue<int> Q; Q.push(1), vec[1].eb(mp(0, 0));
    while (!Q.empty()) {
        int x = Q.front(); Q.pop();
        sort(vec[x].begin(), vec[x].end());
        vector<pii> f;
        for(pii k : vec[x]) {
            while (f.size() > 1 && slope(f.back(), f[f.size() - 2]) >= slope(k, f.back())) f.pop_back();
            f.eb(k);
        }
        swap(vec[x], f);
        for(pii e : G[x]) {
            for(pii k : vec[x]) {
                vec[e.fi].eb(k + mp(!e.se, e.se)), --deg[e.fi];
                if (!deg[e.fi]) Q.push(e.fi);
            }
        }
    }
}

int calc(int a, int b, pii k){return a * k.fi + b * k.se;}
int Query(int u, int a, int b) {
    if (vec[u].size() == 1) calc(a, b, vec[u][0]);
    double k = -1.0 * a / b;
    int l = 0, r = vec[u].size() - 2, mid = l + r >> 1, bst = 0;
    for(; l <= r; mid = l + r >> 1)
        if (slope(vec[u][mid], vec[u][mid + 1]) >= k) bst = mid, r = mid - 1; else l = mid + 1;
    return min(calc(a, b, vec[u][bst]), calc(a, b, vec[u].back()));
}

int main() {
    read(n), read(m);
    for(int i = 1, u, v, w; i <= m; i++) read(u), read(v), read(w), G[u].eb(mp(v, w)), ++deg[v];
    TopuSort(); int q; read(q);
    for(int a, b, u; q; --q) read(a), read(b), read(u), printf("%d\n", Query(u, a, b));
}