#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,m,n) for (int i = (m); i < (n); ++i)
#define rep3(i,a,b) for (int i = (a); i >= (b); --i)
#define all(x) (x).begin(),(x).end()
inline int popcount(const int x) { return __builtin_popcount(x);}
inline ll popcount(const ll x) { return __builtin_popcountll(x);}
template<class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b;}
template<class T> void chmax(T &a, const T &b) noexcept { if (a < b) a = b;}
template<class T> void drop(const T &x) { std::cout<<x<<endl; exit(0);}
void debug_out() { std::cout << "\n";}
template<class T, class... Args> void debug_out(const T &x, const Args &... args) { std::cout<<x<< " "; debug_out(args...);}
#ifdef _DEBUG
  #define debug(...) debug_out(__VA_ARGS__)
#else
  #define debug(...) 
#endif

struct InitIO{
  InitIO() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
  }
}init_io;


template<typename T> struct LowestCommonAncestor {
  private:
    vector<vector<int> > par;
    vector<int> dist; //from root
    vector<T> weight; //from root
    vector<vector<T> > max_w;
    const vector<vector<pair<int,T> > > &G;

    void dfs_(int v, int p, int d, T w) {
      par[0][v] = p;
      dist[v] = d;
      weight[v] = w;
      for (auto to : G[v]) {
        if (to.first == p) continue; 
        dfs_(to.first, v, d+1, w+to.second);
        max_w[0][to.first] = to.second;
      }
    }
    int query(int u,int v) {
      assert(u < (int)dist.size());
      assert(v < (int)dist.size());
      if (dist[u] > dist[v]) swap(u,v);
      int k = par.size();
      for (int i = 0; i < k; ++i) { //LCAまでの距離を揃える
        if (((dist[v]-dist[u])>>i) & 1) v = par[i][v];
      }
      if (u == v) return u;
      for (int i = k-1; i >= 0; --i) {
        if (par[i][u] == par[i][v]) continue;
        u = par[i][u];
        v = par[i][v];
      }
      return par[0][u];
    }
  public:
    LowestCommonAncestor(const vector<vector<pair<int,T> > > &G, int root = 0):G(G){
      int n = G.size(), k = 1;
      while ((1<<k) < n) k++;
      par.assign(k, vector<int>(n,-1));
      dist.assign(n,-1);
      weight.assign(n,-1);
      max_w.assign(k, vector<T>(n,-1));
      dfs_(root, -1, 0, 0);
      for (int i = 0; i < k-1; ++i) {
        for (int v = 0; v < n; ++v) {
          if (par[i][v] < 0) par[i+1][v] = -1;
          else {
            par[i+1][v] = par[i][par[i][v]];
            max_w[i+1][v] = max(max_w[i][v], max_w[i][par[i][v]]);
          }
        }
      }
    }
    T get_max_w(int u, int v) {
      int x = query(u,v), k = par.size();
      T res = 0;
      for (int i = 0; i < k; ++i) { //LCAまで移動
        if (((dist[x]-dist[u])>>i) & 1) {
          chmax(res, max_w[i][u]);
          u = par[i][u];
        }
      }
      for (int i = 0; i < k; ++i) {
        if (((dist[x]-dist[v])>>i) & 1) {
          chmax(res, max_w[i][v]);
          v = par[i][v];
        }
      }
      return res;
    }
    int operator()(int u,int v){ return query(u,v);}
    int get_dist(int u, int v){ return dist[u] + dist[v] - 2*dist[query(u,v)];}
    T get_weight(int u, int v){ return weight[u] + weight[v] - 2*weight[query(u,v)];}
    bool is_on_path(int u, int v, int a){ return get_dist(u,a)+get_dist(a,v)==get_dist(u,v);}
};

int main() {
  int n;
  cin >> n;
  vector<vector<pair<int, ll> > > G(n);
  rep(i, n-1) {
    int a, b, c;
    cin >> a >> b >> c; a--; b--;
    G[a].emplace_back(b, c);
    G[b].emplace_back(a, c);
  }
  LowestCommonAncestor<ll> LCA(G);
  int q;
  cin >> q;
  while(q--) {
    int s, t;
    cin >> s >> t; s--; t--;
    cout << LCA.get_weight(s, t) << "\n";
  }
  return 0;
}