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

int main() {
  ios::sync_with_stdio(false);

  int N;
  cin >> N;

  vector<vector<pair<int, int>>> G(N);
  for (int i = 0; i < N - 1; ++i) {
    int U, V, W;
    cin >> U >> V >> W;
    G[U].emplace_back(W, V);
    G[V].emplace_back(W, U);
  }

  vector<int> dpt(N);
  vector<int64_t> d2r(N);
  vector<vector<int>> fa2(17, vector<int>(N, -1));
  vector<vector<int64_t>> du2(17, vector<int64_t>(N)); {
    function<void(int, int)> dfs = [&](int u, int fa) {
      for (int i = 0; i < G[u].size(); ++i) {
        int w, v;
        tie(w, v) = G[u][i];
        if (v == fa) continue;
        dpt[v] = dpt[u] + 1;
        d2r[v] = d2r[u] + w;
        fa2[0][v] = u;
        du2[0][v] = w;
        dfs(v, u);
      }
    };
    dfs(0, -1);
    for (int i = 0; i + 1 < fa2.size(); ++i) {
      for (int u = 0; u < N; ++u) {
        int x = fa2[i][u];
        if (x == -1) continue;
        fa2[i + 1][u] = fa2[i][x];
        du2[i + 1][u] = du2[i][u] + du2[i][x];
      }
    }
  }

  auto lca = [&](int u, int v) {
    if (dpt[u] < dpt[v]) swap(u, v);
    for (int i = fa2.size() - 1; dpt[u] != dpt[v]; --i) {
      if (dpt[u] - dpt[v] >= 1 << i) {
        u = fa2[i][u];
      }
    }
    if (u == v) return u;
    for (int i = fa2.size() - 1; fa2[0][u] != fa2[0][v]; --i) {
      if (fa2[i][u] != fa2[i][v]) {
        u = fa2[i][u];
        v = fa2[i][v];
      }
    }
    assert(fa2[0][u] == fa2[0][v]);
    return fa2[0][u];
  };

  auto dis = [&](int u, int v) { return d2r[u] + d2r[v] - 2 * d2r[lca(u, v)]; };

  int Q;
  cin >> Q;

  while (Q--) {
    int X, Y, Z;
    cin >> X >> Y >> Z;
    cout << (dis(X, Y) + dis(Y, Z) + dis(Z, X) >> 1) << endl;
  }

  return 0;
}