#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};

vector<vector<edge>> e;

struct segment_tree{
  ll N;
  llvec v;
  ll init=5e18;//initial value
  ll f(ll a, ll b){ //function
    return min(a, b);
  }
  segment_tree(ll n){
    N=1;
    while(N<n){
      N*=2;
    }
    v = llvec(2*N-1, init);
  }
  
  void set(ll i, ll val){
    i += N-1;
    v[i] = val;
    while(i>0){
      i = (i-1)/2;
      v[i] = f(v[i*2+1], v[i*2+2]);
    }
  }
  void add(ll i, ll val){
    i += N-1;
    v[i] += val;
    while(i>0){
      i = (i-1)/2;
      v[i] = f(v[i*2+1], v[i*2+2]);
    }
  }

  ll get(ll L, ll R){// L <= i < R
    L += N-1;
    R += N-1;
    ll vl = init;
    ll vr = init;
    while(L<R){
      if(L%2==0){
        vl = f(vl, v[L]);
        L++;
      }
      if(R%2==0){
        vr = f(vr, v[R-1]);
        R--;
      }
      R=(R-1)/2;
      L=(L-1)/2;
    }
    return f(vl, vr);
  }

  ll operator[](ll i){
    return v[i+N-1];
  }
  
};

llvec a;
llvec v;

void dfs(ll from, ll to, ll c){
  v[to] = a.size();
  a.push_back(c);
  for(auto ie: e[to]){
    if(ie.x == from)continue;
    dfs(to, ie.x, c+ie.c);
    a.push_back(c);
  }
  return;
}

/**************************************
** A main function starts from here  **
***************************************/
int main(){
  ll N;
  cin >> N;
  e = vector<vector<edge>>(N);
  rep(i, N-1){
    ll u, v, c;
    cin >> u >> v >> c;
    //u--;v--;
    e[u].push_back({v, c});
    e[v].push_back({u, c});
  }
  v = llvec(N);
  dfs(-1, 0, 0);
  segment_tree sg(a.size());
  rep(i, a.size()){
    sg.set(i, a[i]);
  }

  ll Q;
  cin >> Q;
  while(Q--){
    ll x, y, z;
    cin >> x >> y >> z;
    if(v[x]>v[y]){
      swap(x, y);
    }
    if(v[y]>v[z]){
      swap(y, z);
    }
    if(v[x]>v[z]){
      swap(x, z);
    }
    ll a = sg.get(v[x], v[y]+1);
    ll b = sg.get(v[y], v[z]+1);
    ll A = sg[v[x]] + sg[v[y]] - a;
    ll B = sg[v[z]] + sg[v[y]] - b;
    cout << A + B - ( sg[v[y]] - a) << endl;
  }
  
  return 0;
}