#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define foru(i,from,n) for(int i=from;i<(int)(n);i++)
#define ford(i,from,n) for(int i=(int)(n)-1;i>=0;i--)
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define _ << " " <<
#ifdef LOCAL
#define OUT(a) {cerr<<"#"<<#a; for(auto it_a : a)cerr _ it_a; cerr<<endl;}
#else
#define OUT(a) 
#endif
using namespace std;

#ifdef LOCAL
#include "lib/trace.h"
#else
#define trace(...) 'z'
#endif

constexpr int MAX_N = 100000;
bool vis[MAX_N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifndef LOCAL
        freopen("meeting.in", "r", stdin);
        freopen("meeting.out", "w", stdout);
    #endif

    int N; 
    scanf("%d",&N);
    vector<vector<pair<int,int>>> adj(N);
    for(int i=0;i+1<N;i++) {
        int a,b,c;
        scanf("%d %d %d",&a,&b,&c);
        adj[a].emplace_back(b,c);
        adj[b].emplace_back(a,c);
    }

    int Q;
    scanf("%d",&Q);
    int cost;

    function<int(int,int)> dfs = [&](int a, int par) {
        if (vis[a]) {
            return a;
        }
        for(auto& pii: adj[a]) {
            int e = pii.first;
            if (e == par) continue;
            int ret = dfs(e, a);
            if (ret>-1) {
                //trace(a);
                vis[a] = true;
                cost += pii.second;
                return ret;
            }
        }
        return -1;
    };

    for(int q=0;q<Q;q++) {
        int a,b,c;
        scanf("%d %d %d",&a,&b,&c);
        cost = 0;

        memset(vis, false, MAX_N);

        vis[b] = true;

        dfs(a,-1);
        int meet = dfs(c,-1);
        printf("%d %d\n",meet,cost);
    }
    
    return 0;
}