/* -*- coding: utf-8 -*-
 *
 * 1094.cc:  No.1094 木登り / Climbing tree - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int BN = 18;

/* typedef */

typedef queue<int> qi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

/* global variables */

vpii nbrs[MAX_N];
int ds[MAX_N], ps[MAX_N][BN], cs[MAX_N][BN];

/* subroutines */

int pcost(int u, int v) {
  int c = 0;
  if (ds[u] > ds[v]) swap(u, v);

  for (int k = BN - 1; k >= 0; k--)
    if (((ds[v] - ds[u]) >> k) & 1) {
      c += cs[v][k];
      v = ps[v][k];
    }
  if (u == v) return c;

  for(int k = BN - 1; k >= 0; k--)
    if (ps[u][k] != ps[v][k]) {
      c += cs[u][k] + cs[v][k];
      u = ps[u][k];
      v = ps[v][k];
    }
  
  return c + cs[u][0] + cs[v][0];
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i < n; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    a--, b--;
    nbrs[a].push_back(pii(b, c));
    nbrs[b].push_back(pii(a, c));
  }

  ds[0] = 0, ps[0][0] = -1, cs[0][0] = 0;
  qi q;
  q.push(0);

  while (! q.empty()) {
    int u = q.front(); q.pop();

    for (int k = 0; k < BN - 1; k++) {
      if (ps[u][k] >= 0) {
	ps[u][k + 1] = ps[ps[u][k]][k];
	cs[u][k + 1] = cs[u][k] + cs[ps[u][k]][k];
      }
      else
	ps[u][k + 1] = -1;
    }

    int up = ps[u][0], vd = ds[u] + 1;
    vpii &nbru = nbrs[u];
    for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int v = vit->first;
      if (v != up) {
	ds[v] = vd, ps[v][0] = u, cs[v][0] = vit->second;
	q.push(v);
      }
    }
  }

  int qn;
  scanf("%d", &qn);
  while (qn--) {
    int s, t;
    scanf("%d%d", &s, &t);
    s--, t--;

    int c = pcost(s, t);
    printf("%d\n", c);
  }

  return 0;
}