#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
  for(int i=0;i<(int)(s.size());++i) {
    cout << s[i];
    if(i == (int)(s.size())-1) cout << endl;
    else cout << " ";
  }
}
template< typename T >
struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
template< typename G >
struct DoublingLowestCommonAncestor {
  const int LOG;
  vector< int > dep;
  const G &g;
  vector< vector< int > > table;
  DoublingLowestCommonAncestor(const G &g) : g(g), dep(g.size()), LOG(32 - __builtin_clz(g.size())) {
    table.assign(LOG, vector< int >(g.size(), -1));
  }
  void dfs(int idx, int par, int d) {
    table[0][idx] = par;
    dep[idx] = d;
    for(auto &to : g[idx]) {
      if(to != par) dfs(to, idx, d + 1);
    }
  }
  void build() {
    dfs(0, -1, 0);
    for(int k = 0; k + 1 < LOG; k++) {
      for(int i = 0; i < table[k].size(); i++) {
        if(table[k][i] == -1) table[k + 1][i] = -1;
        else table[k + 1][i] = table[k][table[k][i]];
      }
    }
  }
  int query(int u, int v) {
    if(dep[u] > dep[v]) swap(u, v);
    for(int i = LOG - 1; i >= 0; i--) {
      if(((dep[v] - dep[u]) >> i) & 1) v = table[i][v];
    }
    if(u == v) return u;
    for(int i = LOG - 1; i >= 0; i--) {
      if(table[i][u] != table[i][v]) {
        u = table[i][u];
        v = table[i][v];
      }
    }
    return table[0][u];
  }
};
int main() {
  cin.tie(0);
  cout << fixed << setprecision(10);
  int n; cin >> n;
  WeightedGraph<ll> g(n);
  for(int i=0;i<n-1;++i) {
    int u, v, w; cin >> u >> v >> w;
    g[u].push_back(edge<ll>(u, v, w));
    g[v].push_back(edge<ll>(v, u, w));
  }
  WeightedGraph<ll> tr(n);
  vector<ll> dist(n);
  dist[0] = 0;
  queue<P> que;
  que.push({0, -1});
  while(!que.empty()) {
    int now = que.front().first, prev = que.front().second; que.pop();
    for(int i=0;i<(int)(g[now].size());++i) {
      int next = g[now][i].to;
      ll cost = g[now][i].cost;
      if(next != prev) {
        dist[next] = dist[now] + cost;
        tr[now].push_back(edge<ll>(now, next, cost));
        que.push({next, now});
      }
    }
  }
  DoublingLowestCommonAncestor<WeightedGraph<ll>> lca(tr);
  lca.build();
  int q; cin >> q;
  while(q > 0) {
    q--;
    int x, y, z; cin >> x >> y >> z;
    int p1 = lca.query(x, y), p2 = lca.query(p1, z);
    ll mi = (dist[x] + dist[y] - 2 * dist[p1]) + (dist[p1] + dist[z] - 2 * dist[p2]);
    p1 = lca.query(y, z);
    p2 = lca.query(p1, x);
    mi = min(mi, (dist[y] + dist[z] - 2 * dist[p1]) + (dist[p1] + dist[x] - 2 * dist[p2]));
    p1 = lca.query(z, x);
    p2 = lca.query(p1, y);
    mi = min(mi, (dist[z] + dist[x] - 2 * dist[p1]) + (dist[p1] + dist[y] - 2 * dist[p2]));
    cout << mi << endl;
  }
}