//7777777
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<queue>
#include<utility>
#include<vector>
#define lson l , m , rt << 1
#define rson m+1 , r , rt << 1 | 1
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const double pi = 3.1415926535;
const double eps = 1e-6;
const int MX = 1e5 + 7;
const int maxbit = 18;
const double val = pi/180.0;
const int INF = 0x3f3f3f3f;
struct edge
{int to;int val;
};
int father[MX][maxbit];
int depth[MX];
int dis[MX];
int lg[MX];
vector<edge> G[MX];
void dfs(int nowp,int fa)
{depth[nowp] = depth[fa] + 1;father[nowp][0] = fa;for(int j = 1;j <= lg[depth[nowp]] + 1;++j){father[nowp][j] = father[father[nowp][j-1]][j-1];}for(int i = 0;i < G[nowp].size();++i){edge e  = G[nowp][i];if(e.to != fa){dis[e.to] = dis[nowp] + e.val;dfs(e.to,nowp);}}
}
int lca (int u,int v)
{if(depth[u] < depth[v]) swap(u,v);while(depth[u] != depth[v])u = father[u][lg[depth[u] - depth[v]]];if(u == v) return u;for(int j = lg[depth[u]];j >= 0;--j){if(father[u][j] != father[v][j]){u = father[u][j];v = father[v][j];}}return father[u][0];
}
//对大常数的优化
void init()
{lg[0] = -1;for(int i = 1;i < MX;++i) lg[i] = lg[i >> 1] + 1;
}
int main(int argc, char const *argv[])
{int n;int u,v,w;init();//记得初始化scanf("%d",&n);for(int i = 1;i <= n-1;++i){scanf("%d%d%d",&u,&v,&w);//邻接表建图
        G[u].push_back({v,w});G[v].push_back({u,w});}dfs(1,0);scanf("%d%d%d",&u,&v,&w);int m;scanf("%d",&m);while(m--){int x,y;scanf("%d%d",&x,&y);//三种情况int p = lca(x,y);int ans = (dis[x] - dis[p]) + (dis[y] - dis[p]);int p1 = lca(x,u);int p2 = lca(y,v);int alt1 = (dis[x] - dis[p1]) + (dis[u] - dis[p1]);int alt2 = (dis[y] - dis[p2]) + (dis[v] - dis[p2]);ans = min(ans,alt1 + alt2 + w);p1 = lca(x,v);p2 = lca(y,u);alt1 = (dis[x] - dis[p1]) + (dis[v] - dis[p1]);alt2 = (dis[y] - dis[p2]) + (dis[u] - dis[p2]);ans = min(ans,alt1 + alt2 + w);printf("%d\n",ans);}return 0;
}