#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

struct weighted_LCA_tree{
    int _n,MAX_LOG_V,root;
    vector<vector<pair<int,int>>> g;
    vector<vector<int>> parent;
    vector<int> depth,_dist;
    weighted_LCA_tree() : _n(0) {}
    weighted_LCA_tree(int n) : _n(n), g(n),depth(n),_dist(n) {
        MAX_LOG_V=1;
        while(_n>>MAX_LOG_V)MAX_LOG_V++;
        parent.resize(MAX_LOG_V,vector<int>(_n));
    }
    void merge(int u,int v,int c){
        g[u].emplace_back(v,c);
        g[v].emplace_back(u,c);
    }
    void dfs(int v,int p,int d,int di){
        parent[0][v]=p;
        depth[v]=d;
        _dist[v]=di;
        int u,c;
        for(int i=0;i<g[v].size();i++){
            tie(u,c)=g[v][i];
            if(u!=p)dfs(u,v,d+1,di+c);
        }
    }
    void init(int r){
        root=r;
        dfs(root,-1,0,0);
        for(int j=0;j+1<MAX_LOG_V;j++){
            for(int i=0;i<_n;i++){
                if(parent[j][i]<0)parent[j+1][i]=-1;
                else parent[j+1][i]=parent[j][parent[j][i]];
            }
        }
    }
    int lca(int u,int v){
        if(depth[u]>depth[v])swap(u,v);
        for(int i=0;i<MAX_LOG_V;i++){
            if((depth[v]-depth[u])>>i&1)v=parent[i][v];
        }
        if(u==v)return u;
        for(int i=MAX_LOG_V-1;i>=0;i--){
            if(parent[i][u]!=parent[i][v]){
                u=parent[i][u];
                v=parent[i][v];
            }
        }
        return parent[0][u];
    }
    //パスの辺数
    int dist(int u,int v){
        int lcav=lca(u,v);
        if(lcav==-1)return _dist[u]+_dist[v];
        return _dist[u]+_dist[v]-2*_dist[lcav];
    }
    //頂点wが頂点u,vのパス上に存在するか
    int on_path(int u,int v,int w){
        return (dist(u,w)+dist(v,w)==dist(u,v));
    }
};

int main(){
    INT(n);
    weighted_LCA_tree g(n);
    int u,v,c;
    rep(i,n-1){
        in(u,v,c);
        g.merge(--u,--v,c);
    }
    g.init(0);
    codefor{
        in(u,v);
        out(g.dist(--u,--v));
    }
}