#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];

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]++;
    }
    opt[1] = {pair(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]) {
                    for (const auto &[a, b]: opt[i]) opt[x].emplace_back(a + (w==0), b + (w==1));
                    // fix opt[x]
                    {
                        sort(A(opt[x])); 
                        vector<pl> temp;
                        // compute pareto front (should probably reason about this, i ahve shit intuition)
                        for (auto [x, y]: opt[x]) {
                            while (temp.size() and y >= temp.back().V) temp.pop_back();
                            temp.emplace_back(x, y);
                        }
                        opt[x] = temp;
                    }
                    // 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);
                }
            }
        }
    }

    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';
    }
    
}