/*+Rainybunny+*/

#include <bits/stdc++.h>

#define rep(i, l, r) for (int i = l, rep##i = r; i <= rep##i; ++i)
#define per(i, r, l) for (int i = r, per##i = l; i >= per##i; --i)

typedef std::pair<int, int> PII;
#define fi first
#define se second

inline char fgc() {
    static char buf[1 << 17], *p = buf, *q = buf;
    return p == q && (q = buf + fread(p = buf, 1, 1 << 17, stdin), p == q) ?
      EOF : *p++;
}

template <typename Tp = int>
inline Tp rint() {
    Tp x = 0, s = fgc(), f = 1;
    for (; s < '0' || '9' < s; s = fgc()) f = s == '-' ? -f : f;
    for (; '0' <= s && s <= '9'; s = fgc()) x = x * 10 + (s ^ '0');
    return x * f;
}

template <typename Tp>
inline void wint(Tp x) {
    if (x < 0) putchar('-'), x = -x;
    if (9 < x) wint(x / 10);
    putchar(x % 10 ^ '0');
}

inline void chkmin(int& u, const int v) { v < u && (u = v, 0); }

const int MAXN = 5e4, IINF = 0x3f3f3f3f;
int n, m, q, qa[MAXN + 5], qb[MAXN + 5], qt[MAXN + 5];
std::vector<PII> adj[MAXN + 5];

namespace Subtask2 {

int dis[MAXN + 5];

inline void main() {
    rep (i, 2, n) {
        dis[i] = IINF;
        for (const PII& e: adj[i]) chkmin(dis[i], dis[e.fi] + 1);
    }
    rep (i, 1, q) wint(dis[qt[i]] * qa[i]), putchar('\n');
}

} // namespace Subtask2

namespace ShuodeDaoli {

std::map<int, int> dis[MAXN + 5];

inline void init() {
    dis[1][0] = 0;
    rep (i, 2, n) {
        auto touch = [&](const int v)->int& {
            auto&& it = dis[i].lower_bound(v);
            if (it != dis[i].end() && it->fi == v) return it->se;
            else return dis[i].emplace_hint(it, v, IINF)->se;
        };

        for (const PII& e: adj[i]) {
            for (auto&& it = dis[e.fi].begin(); it != dis[e.fi].end(); ++it) {
                chkmin(touch(it->fi + !e.se), it->se + e.se);
            }
        }

        for (auto&& it = dis[i].begin(); it != dis[i].end();) {
            auto&& nx = std::next(it);
            if (nx == dis[i].end()) break;
            if (nx->se >= it->se) dis[i].erase(nx);
            else it = nx;
        }
    }
}

inline void main() {
    init();
    rep (i, 1, q) {
        int ans = IINF;
        for (auto&& it = dis[qt[i]].begin(); it != dis[qt[i]].end(); ++it) {
            chkmin(ans, qa[i] * it->fi + qb[i] * it->se);
        }
        printf("%d\n", ans);
    }
}

} // namespace ShuodeDaoli

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

    n = rint(), m = rint();
    rep (i, 1, m) {
        int u = rint(), v = rint(), c = rint();
        adj[v].emplace_back(u, c);
    }
    q = rint();
    rep (i, 1, q) qa[i] = rint(), qb[i] = rint(), qt[i] = rint();

    bool proA = true;
    rep (i, 1, q) proA &= qa[i] == qb[i];
    if (proA) return Subtask2::main(), 0;

    ShuodeDaoli::main();
    return 0;
}