#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

class TreeDistance{
    int n;                                              // 頂点数
    int max_log_n;
    int root;                                           // 木の根
    vector<vector<pair<int, int>>> edges;

    vector<long long> distance_from_root;               // 根からの距離
    vector<int> depth;                                  // 根からの深さ
    vector<vector<int>> parent;                         // 親を2^k回辿って到達する頂点(根を通り過ぎる場合は-1とする)

public:
    void init(int n, int root, vector<vector<pair<int, int>>> &edges) {
        this->n = n;
        this->root = root;
        this->edges = edges;

        max_log_n = int(log2(n)) + 1;
        distance_from_root.assign(n, -1);
        distance_from_root[root] = 0;
        depth.assign(n, -1);
        parent.assign(max_log_n, vector<int>(n, -1));

        // 木のrootからの各頂点への距離，深さ，を求める
        dfs(root, -1, 0);

        // parentを初期化する
        for (int k = 0; k + 1 < max_log_n; ++k) {
            for (int v = 0; v < n; ++v) {
                if (parent[k][v] < 0) {
                    parent[k + 1][v] = -1;
                }
                else parent[k + 1][v] = parent[k][parent[k][v]];
            }
        }
    }

    long long distance(int u, int v) {
        return distance_from_root[u] + distance_from_root[v] - 2 * distance_from_root[lca(u, v)];
    }

    // uとvのLCAを求める
    int lca(int u, int v) {
        // uとvの深さが同じになるまで親を辿る
        if (depth[u] > depth[v]) {
            swap(u, v);
        }
        for (int k = 0; k < max_log_n; ++k) {
            if ((depth[v] - depth[u]) >> k & 1) {
                v = parent[k][v];
            }
        }
        if (u == v) {
            return u;
        }
        // 二分探索でLCAを求める
        for (int k = max_log_n - 1; k >= 0; --k) {
            if (parent[k][u] != parent[k][v]) {
                u = parent[k][u];
                v = parent[k][v];
            }
        }
        return parent[0][u];
    }


private:
    void dfs(int v, int p, int d) {
        parent[0][v] = p;
        depth[v] = d;
        for(auto node_dist : edges.at(v)) {
            if (node_dist.first != p and node_dist.first != v) {
                distance_from_root[node_dist.first] = distance_from_root[v] + node_dist.second;
                dfs(node_dist.first, v, d + 1);
            }
        }
    }
};

int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

    vector<vector<pair<int, int>>> edges(N);
    FOR(i, 0, N - 1) {
        int a, b, c;
        cin >> a >> b >> c;
        edges[a - 1].emplace_back(make_pair(b - 1, c));
        edges[b - 1].emplace_back(make_pair(a - 1, c));
    }

    TreeDistance td;
    td.init(N, 0, edges);

    int Q, K;
    cin >> Q >> K;
    FOR(i, 0, Q) {
        int x, y;
        cin >> x >> y;
        print(td.distance(x - 1, K - 1) + td.distance(K - 1, y - 1));
    }

	return 0;
}

Measured memory_bytes: 24184