#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <cp/debugger.hpp>
#else
#define debug(...) 42
#endif

#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()

typedef int64_t int64;
typedef pair<int, int> ii;

using T = int64;
struct Point {
  T x;
  T y;

  Point(T x, T y) : x(x), y(y) {}

  Point &operator+=(const Point &p) {
    x += p.x, y += p.y;
    return *this;
  }

  Point &operator-=(const Point &p) {
    x -= p.x, y -= p.y;
    return *this;
  }

  Point &operator*=(const T &v) {
    x *= v, y *= v;
    return *this;
  }

  friend Point operator-(const Point &p) { return Point(-p.x, -p.y); }
  friend Point operator+(Point lhs, const Point &rhs) { return lhs += rhs; }
  friend Point operator-(Point lhs, const Point &rhs) { return lhs -= rhs; }
  friend Point operator*(Point lhs, const T &rhs) { return lhs *= rhs; }
};

T dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }

T cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; }

string to_string(Point p) { return "(" + to_string(p.x) + ", " + to_string(p.y) + ")"; }

void add(vector<Point> &hull, Point p) {
  while (hull.size() >= 2 && cross(hull.end()[-1] - hull.end()[-2], p - hull.end()[-1]) < 0) hull.pop_back();
  hull.push_back(p);
}

vector<Point> merge(const vector<Point> &a, const vector<Point> &b) {
  vector<Point> res;
  int l1 = 0, l2 = 0;
  while (l1 < a.size() || l2 < b.size()) {
    if (l1 < a.size() && l2 < b.size()) {
      if (a[l1].x < b[l2].x)
        add(res, a[l1]), l1++;
      else
        add(res, b[l2]), l2++;
    } else if (l1 < a.size()) {
      add(res, a[l1]), l1++;
    } else {
      add(res, b[l2]), l2++;
    }
  }

  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  vector<vector<array<int, 2>>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v, c;
    cin >> u >> v >> c;
    u--, v--;
    g[v].push_back({u, c});
  }

  vector<vector<array<int, 3>>> queries(n);
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int a, b, x;
    cin >> a >> b >> x;
    x--;
    queries[x].push_back({a, b, i});
  }

  const int D = 1024;
  vector<vector<Point>> hull(D);
  hull[0].push_back(Point(0, 0));

  vector<int64> res(q);

  for (int i = 1; i < n; i++) {
    for (auto [v, c] : g[i]) {
      for (auto &p : hull[v % D]) {
        if (c == 0)
          p.x++;
        else
          p.y++;
      }
      hull[i % D] = merge(hull[i % D], hull[v % D]);
      for (auto &p : hull[v % D]) {
        if (c == 0)
          p.x--;
        else
          p.y--;
      }
    }
    for (auto [a, b, id] : queries[i]) {
      int64 ans = 1e18;
      Point q(a, b);
      for (auto p : hull[i % D]) {
        ans = min(ans, dot(p, q));
      }
      res[id] = ans;
    }
  }

  for (int i = 0; i < q; i++) {
    cout << res[i] << '\n';
  }

  return 0;
}