#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

vector<vector<int> > doubling(const vector<int> &v) {
  int n = v.size();
  int m = 1;
  while ((1LL<<m+1) < n) ++m;
  vector<vector<int> > dp(m, vector<int>(n));
  for (int i = 0; i < n; i++) dp[0][i] = v[i];
  for (int i = 1; i < m; i++) {
    for (int j = 0; j < n; j++) {
      int tmp = dp[i-1][j];
      if (tmp == -1)
        dp[i][j] = -1;
      else
        dp[i][j] = dp[i-1][tmp];
    }
  }
  return dp;
}

int lca(int v, int w, const vector<vector<int> > &par, const vector<int> &depth) {
  if (depth[w] > depth[v])
    swap(v, w);
  
  for (int i = 0; i < par.size(); i++) {
    int d = depth[v] - depth[w];
    if (d & 1 << i) {
      v = par[i][v];
    }
  }
  
  if (v == w) return v;
  
  for (int i = par.size() - 1; i >= 0; i--) {
    if (par[i][v] != par[i][w]) {
      v = par[i][v];
      w = par[i][w];
    }
  }
  return par[0][v];
}

int n;
vector<pair<int, int> > edges[100000];
vector<int> par;
vector<int> depth;
vector<long long> weight;

void dfs(int v, int p=-1, int d=0, long long w=0) {
  par[v] = p;
  depth[v] = d;
  weight[v] = w;
  for (auto& [x, y] : edges[v]) {
    if (x == p) continue;
    dfs(x, v, d+1, w+y);
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n;
  
  par.resize(n);
  depth.resize(n);
  weight.resize(n);
  
  REP (i, n-1) {
    int u, v, w;
    cin >> u >> v >> w;
    edges[u].emplace_back(v, w);
    edges[v].emplace_back(u, w);
  }

  dfs(0);
  auto pp = doubling(par);

  int q;
  cin >> q;
  while (q--) {
    int x, y, z;
    cin >> x >> y >> z;
    long long ret = 0;
    ret += weight[x] + weight[y] - 2 * weight[lca(x, y, pp, depth)];
    ret += weight[y] + weight[z] - 2 * weight[lca(y, z, pp, depth)];
    ret += weight[z] + weight[x] - 2 * weight[lca(z, x, pp, depth)];
    cout << ret / 2 << endl;
  }
  
  return 0;
}