#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

#define NN 50010
#define M 1000000007 // 998244353

vector<pl> opt[NN];
ll indeg[NN];
vector<pl> adj[NN];

vl optVec[NN]; // convert to opt later 

int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);
    G(n) G(m) while(m--) {
        G(u) G(v) G(c)
        adj[u].emplace_back(v,c);
        indeg[v]++;
    }

    F(i, 1, n+1) optVec[i].assign(n+1, n+1);
    optVec[1][0] = 0;

    {
        vector<ll> q{1}, nq;
        for (; q.size(); swap(q, nq), nq.clear()) {
            for (auto i: q) {
                for (auto [x, w]: adj[i]) {
                    F(white, 0, n) optVec[x][white + (w == 0)] = min(optVec[x][white + (w == 0)], optVec[i][white] + (w == 1));
                    // idk if this is needed or some more sophisticated merging is needed or some dumb merging is fine
                    if (!--indeg[x]) nq.push_back(x);
                }
            }
        }
    }

    F(cur, 1, n+1) {
        // compute pareto front (should probably reason about this, i ahve shit intuition)
        FD(x, optVec[cur].size()-1, -1) {
            ll y = -optVec[cur][x];
            while (opt[cur].size() and y >= opt[cur].back().V) opt[cur].pop_back();
            opt[cur].emplace_back(x, y);
        }
        for (auto &[x, y]: opt[cur]) y=-y;
    }

    // Fe

    G(q) while(q--){
        G(a) G(b) G(t)
        ll ans = INT_MAX;
        for (auto [x, y]: opt[t]) ans = min(ans, x*a + y*b);
        cout << ans << '\n';
    }
    
}