#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 5e4 + 5, M = 1500 + 5, K = 1e3 + 1;
struct edge { int u, c; } ;
struct qry { int a, b, id; } ;
struct node { int x, y; } A[M], st[M], f[M][M]; 
int n, m, u, v, c, q, a, b, x, tp, res, cnt[N], ans[N]; 
vector <edge> G[N]; 
vector <qry> Q[N]; 

double slope (node a, node b) {
  return 1.0 * (a.y - b.y) / (a.x - b.x); 
} 
void insert (node p) {
  for ( ; tp > 1 && slope(st[tp - 1], st[tp]) > slope(st[tp - 1], p); --tp) ;
  st[++tp] = p; 
}
void Merge (int &c1, node *A, int c2, node *B) {
  int i = 1, j = 1; tp = 0; 
  for ( ; i <= c1 && j <= c2; ) {
    if(A[i].x == B[j].x) insert((node){A[i].x, min(A[i].y, B[j].y)}), ++i, ++j; 
    else if(A[i].x < B[j].x) insert(A[i]), ++i;
    else insert(B[j]), ++j; 
  }
  for ( ; i <= c1; ++i) insert(A[i]); 
  for ( ; j <= c2; ++j) insert(B[j]); 
  c1 = tp; 
  rep(i, 1, c1) A[i] = st[i]; 
}

int main () {
  ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0); 
  cin >> n >> m; 
  rep(i, 1, m) cin >> u >> v >> c, G[v].push_back((edge){u, c}); 
  cin >> q;
  rep(i, 1, q) cin >> a >> b >> x, Q[x].push_back((qry){a, b, i});
  f[1][cnt[1] = 1] = (node){0, 0}; 
  rep(i, 2, n) {
    int u = i % K; cnt[u] = 0; 
    for (auto e : G[i]) {
      res = cnt[e.u % K];
      rep(j, 1, res) {
        A[j] = f[e.u % K][j];
        A[j].x += (!e.c), A[j].y += (e.c); 
      } 
      Merge(cnt[u], f[u], res, A); 
    }
    sort(Q[i].begin(), Q[i].end(), [](qry a, qry b) { 
      return -1.0 * a.a / a.b < -1.0 * b.a / b.b; 
    }); 
    for (int j = 0, k = 1; j < Q[i].size(); ++j) {
      for ( ; k < cnt[u] && slope(f[u][k], f[u][k + 1]) < -1.0 * Q[i][j].a / Q[i][j].b; ++k) ;
      ans[Q[i][j].id] = Q[i][j].a * f[u][k].x + Q[i][j].b * f[u][k].y; 
    }
  }
  rep(i, 1, q) cout << ans[i] << '\n';  
  return 0; 
}