#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

struct edge {
    lint to, cost;
    edge(lint to, lint cost) {
        this->to = to;
        this-> cost = cost;
    }
};

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    lint N;
    cin >> N;
    vec<vec<edge>> adj(N, vec<edge>());
    range(i, 0, N - 1) {
        lint a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        adj.at(a).emplace_back(b, c);
        adj.at(b).emplace_back(a, c);
    }
    lint Q, K;
    cin >> Q >> K;
    K--;
    vec<plint> queries;
    range(i, 0, Q) {
        lint x, y;
        cin >> x >> y;
        x--; y--;
        queries.emplace_back(x, y);
    }

    vec<lint> dist_from_root(N, -1);
    dist_from_root.at(K) = 0;
    deque<lint> nodes_in_process;
    nodes_in_process.emplace_back(K);
    while (!nodes_in_process.empty()) {
        lint node = nodes_in_process.front();
        nodes_in_process.pop_front();
        for (const auto &e : adj.at(node)) {
            if (dist_from_root.at(e.to) == -1) {
                dist_from_root.at(e.to) = dist_from_root.at(node) + e.cost;
                nodes_in_process.emplace_back(e.to);
            }
        }
    }
    // cout << queries << "\n";
    for (const auto q : queries) {
        cout << dist_from_root.at(q.first) + dist_from_root.at(q.second) << "\n";
    }
}

Measured memory_bytes: 11636