#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace atcoder;
using ll = long long;
const ll MOD1 = 1000000007LL;
const ll MOD2 = 998244353LL;
using namespace std;
const vector<pair<int, int>> dpos4 = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
// const vector<pair<int, int>> dpos8 = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};

template <typename T>
bool chmax(T &a, const T& b) {
  if (a < b) {
    a = b;  // aをbで更新
    return true;
  }
  return false;
}
// aよりもbが小さいならばaをbで更新する
// (更新されたならばtrueを返す)
template <typename T>
bool chmin(T &a, const T& b) {
  if (a > b) {
    a = b;  // aをbで更新
    return true;
  }
  return false;
}
int N;
vector<vector<pair<int, ll>>> edges;
int depth[100100];
ll dist[100100];
int parent[20][100100];

void dfs(int fr, int prev = -1){
  for(auto [to, cost]: edges[fr]){
    if(to == prev) continue;
    depth[to] = depth[fr] + 1;
    dist[to] = dist[fr] + cost;
    parent[0][to] = fr;
    dfs(to, fr);
  }
}

int la(int fr, int h){
  for(int i = 19; i >= 0; i--){
    if((1<<i) <= h){
      fr = parent[i][fr];
      h -= (1 << i);
    }
  }
  return fr;
}

int lca(int a, int b){
  if(depth[a] < depth[b]) swap(a, b);
  a = la(a, depth[a] - depth[b]);
  if(a == b) return a;
  for(int i = 19; i >= 0; i--){
    if(parent[i][a] == parent[i][b]) continue;
    a = parent[i][a];
    b = parent[i][b];
  }
  return parent[0][a];
}

ll func(int a, int b){
  int p = lca(a, b);
  return dist[a] + dist[b] - 2 * dist[p];
}

int main() {
  cin >> N;
  edges.resize(N);
  rep(i, N - 1){
    int a, b;
    ll c;
    cin >> a >> b >> c;
    edges[a].emplace_back(b, c);
    edges[b].emplace_back(a, c);
  }
  
  depth[0] = 0;
  dist[0] = 0;
  parent[0][0] = 0;
  dfs(0);
  
  for(int i = 1; i < 20; i++){
    rep(j, N){
      parent[i][j] = parent[i - 1][parent[i - 1][j]];
    }
  }
  
  int Q;
  cin >> Q;
  rep(i, Q){
    int a, b, c;
    cin >> a >> b >> c;
    ll ans = func(a, b) + func(b, c) + func(c, a);
    ans /= 2;
    cout << ans << '\n';
  }
  
  return 0;
}