2370 小机房的树

 http://codevs.cn/problem/2370/

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)


//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/



const int maxn=2e5+9;
const int mod=1e9+7;

struct E
{
    int to,cost,nex;
}edge[maxn*4];

int n,m,c;
int head[maxn];
int tot;
int rk[maxn],f[maxn],d[maxn],siz[maxn],son[maxn],top[maxn],id[maxn];
int cnt;
int dis[maxn];
void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].cost=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void dfs1(int u,int fa,int depth,int di)//当前节点，父节点，深度
{
    //cout<<u<<endl;
    f[u]=fa;
    d[u]=depth;
    siz[u]=1;//本身是1
    dis[u]=di;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        int w=edge[i].cost;
        if(v==fa) continue;
        dfs1(v,u,depth+1,di+w);
        siz[u]+=siz[v];
        if(siz[v]>siz[son[u]])
            son[u]=v;
    }
}
void dfs2(int u,int t)//当前节点。重链顶端
{
    top[u]=t;
    id[u]=++cnt;
    rk[cnt]=u;
    if(!son[u]) return ;
    dfs2(son[u],t);
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v!=son[u]&&v!=f[u])
            dfs2(v,v);
    }
}
int LCA(int x,int y)
{
    for(;top[x]!=top[y];d[top[x]]>d[top[y]]?x=f[top[x]]:y=f[top[y]]);
    return d[x]<d[y]?x:y;
}
void init()
{
    tot=0;
    mem(head,-1);
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    scanf("%d",&n);
    init();
    int u,v,w;
    for(int i=0;i<n-1;i++)
    {
        scanf("%d%d%d",&u,&v,&w);
        u++;
        v++;
        addedge(u,v,w);
        addedge(v,u,w);
    }
    sfi(m);
    dfs1(1,0,1,0);
    dfs2(1,1);
    while(m--)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        a++;
        b++;
        int lc=LCA(a,b);
        printf("%d\n",dis[a]+dis[b]-2*dis[lc]);
    }


    return 0;
}