#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

#define ll long long

using namespace std;

int read(){

    char c;int s=,t=;

    while(!isdigit(c=getchar()))if(c=='-')t=-;

    do{s=s*+c-'';}while(isdigit(c=getchar()));

    return s*t;

}

const int maxn=;

int dfn[maxn*],p[maxn],first[maxn],deep[maxn],Q[maxn*][],c[],d[],tot=,num=;

ll dis[maxn];

int logs[maxn*],n,m;

struct edge{int v,w,from;}e[maxn*];

struct cyc{int x,y;}O[maxn];

struct tree{int l,r;cyc o;}t[maxn*];

void insert(int u,int v,int w){tot++;e[tot].v=v;e[tot].w=w;e[tot].from=first[u];first[u]=tot;}

void dfs(int x,int fa){

    dfn[++num]=x;

    if(!p[x])p[x]=num;

    for(int i=first[x];i;i=e[i].from)if(e[i].v!=fa){

        deep[e[i].v]=deep[x]+;

        dis[e[i].v]=dis[x]+e[i].w;

        dfs(e[i].v,x);

        dfn[++num]=x;

    }

}

void prepare(){

    logs[]=-;for(int i=;i<=num;i++)logs[i]=logs[i>>]+;

    for(int i=;i<=num;i++)Q[i][]=dfn[i];

    for(int j=;(<<j)<=num;j++){

        for(int i=;i+(<<j)-<=num;i++){

            if(deep[Q[i][j-]]<deep[Q[i+(<<(j-))][j-]])Q[i][j]=Q[i][j-];

            else Q[i][j]=Q[i+(<<(j-))][j-];

        }

    }

}

int lca(int x,int y){

    if(p[x]>p[y])swap(x,y);

    int k=logs[p[y]-p[x]+];

    return deep[Q[p[x]][k]]<deep[Q[p[y]-(<<k)+][k]]?Q[p[x]][k]:Q[p[y]-(<<k)+][k];

}

bool cmp(int a,int b){return deep[a]<deep[b];}

cyc merge(cyc o1,cyc o2){

    if(!o1.x||!o2.x)return (cyc){,};

    d[]=lca(o1.x,o2.x);d[]=lca(o1.x,o2.y);d[]=lca(o1.y,o2.x);d[]=lca(o1.y,o2.y);

    c[]=lca(o1.x,o1.y);c[]=lca(o2.x,o2.y);

    sort(d+,d++,cmp);if(deep[c[]]>deep[c[]])swap(c[],c[]);

    if(deep[c[]]<=deep[d[]]&&deep[c[]]<=deep[d[]])return (cyc){d[],d[]};else return (cyc){,};//

}

void build(int k,int l,int r){

    t[k].l=l;t[k].r=r;

    if(l==r){t[k].o=O[l];return;}

    int mid=(l+r)>>;

    build(k<<,l,mid);build(k<<|,mid+,r);

    t[k].o=merge(t[k<<].o,t[k<<|].o);

}

cyc query(int k,int l,int r){

    if(l<=t[k].l&&t[k].r<=r)return t[k].o;

    int mid=(t[k].l+t[k].r)>>;cyc x=(cyc){-,};

    if(l<=mid)x=query(k<<,l,r);

    if(r>mid){if(~x.x)x=merge(x,query(k<<|,l,r));else x=query(k<<|,l,r);}

    return x;

}

int main(){

    n=read();

    for(int i=;i<n;i++){

        int u=read(),v=read(),w=read();

        insert(u,v,w);insert(v,u,w);

    }

    dfs(,);

    prepare();

    m=read();

    for(int i=;i<=m;i++)O[i].x=read(),O[i].y=read();

    build(,,m);

    int T=read();

    while(T--){

        int l=read(),r=read();cyc x;

        x=query(,l,r);

        if(!x.x)printf("0\n");else

        printf("%lld\n",dis[x.x]+dis[x.y]-*dis[lca(x.x,x.y)]);

    }

    return ;

}