#include <bits/stdc++.h>
#define pii pair<int, int>
#define fir first
#define sec second
using namespace std;
inline int read() {
    int x = 0, f = 1; char ch = getchar();
    while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
    while (isdigit(ch)) { x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar(); }
    return x * f;
}
const int MAXN = 400010;
int N, Q;
int tot, head[MAXN];
struct Edge {
    int to, nxt;
} edge[MAXN];
void add(int u, int v) {
    edge[++tot].to = v, edge[tot].nxt = head[u]; head[u] = tot;
}
int fa[MAXN][21], dep[MAXN], son[MAXN], len[MAXN];
void dfs(int u, int father) {
    fa[u][0] = father, dep[u] = dep[father] + 1;
    for (int i = 1; i <= 20; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1];
    for (int e = head[u]; e; e = edge[e].nxt) {
        int v = edge[e].to;
        if (v == father) continue;
        dfs(v, u); 
        if (len[u] < len[v] + 1) {
            len[u] = len[v] + 1;
            son[u] = v;
        }
    }
}
int dfn[MAXN], rnk[MAXN], dfncnt;
void Dfs(int u, int father) {
    rnk[dfn[u] = ++dfncnt] = u;
    if (son[u]) Dfs(son[u], u);
    for (int e = head[u]; e; e = edge[e].nxt) {
        int v = edge[e].to;
        if (v != father and v != son[u]) 
            Dfs(v, u);
    }
}
int lca(int x, int y) {
    if (dep[x] < dep[y]) swap(x, y);
    for (int i = 20; i >= 0; i--)
        if (dep[fa[x][i]] >= dep[y]) x = fa[x][i];
    if (x == y) return x;
    for (int i = 20; i >= 0; i--) 
        if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
    return fa[x][0];
}
int dis(int x, int y) {
    return dep[x] + dep[y] - 2 * dep[lca(x, y)];
}
int f[MAXN][4], to[MAXN][4];
void dfs1(int u, int father) {
    vector<pii>D; 
    D.emplace_back(0, u), D.emplace_back(0, u), D.emplace_back(0, u);
    for (int e = head[u]; e; e = edge[e].nxt) {
        int v = edge[e].to;
        if (v == father) continue;
        dfs1(v, u); D.emplace_back(f[v][0] + 1, v);
    }
    sort(D.begin(), D.end(), [](pii x, pii y) {
        return x.fir > y.fir;
    });
    for (int i = 0; i < 3; i++)
        f[u][i] = D[i].fir, to[u][i] = D[i].sec;
}
void dfs2(int u, int father) {
    if (!father) f[u][3] = 0, to[u][3] = u;
    else {
        f[u][3] = f[father][3] + 1, to[u][3] = to[father][3];
        if (f[father][0] == f[u][0] + 1) {
            if (f[u][3] < f[father][1] + 1)
                f[u][3] = f[father][1] + 1, to[u][3] = to[father][1];
        } else {
            if (f[u][3] < f[father][0] + 1)
                f[u][3] = f[father][0] + 1, to[u][3] = to[father][0];
        }
    }
    for (int e = head[u]; e; e = edge[e].nxt) {
        int v = edge[e].to;
        if (v == father) continue;
        dfs2(v, u);
    }
}
struct Query {
    int x, y, z;
} q[MAXN];
struct Node {
    int opt, x, y, z, tim;
} a[MAXN], b[MAXN];
int aans[MAXN];
vector<Query>query[MAXN];
void cdq(int l, int r) {
    if (l == r) return ;
    int mid = (l + r) >> 1;
    cdq(l, mid), cdq(mid + 1, r);
    int L = l, R = mid + 1, cnt = l, Max = 0;
    while (L <= mid and R <= r) {
        if (a[L].y > a[R].y or (a[L].y == a[R].y and a[L].z >= a[R].z)) {
            if (a[L].opt == 1) 
                if (a[Max].z <= a[L].z) Max = L;
            b[cnt++] = a[L++];
        }
        else {
            if (a[R].opt == 2) 
                if (a[R].z <= a[Max].z) aans[a[R].tim] = a[Max].tim;
            b[cnt++] = a[R++];
        }
    }
    while (R <= r) {
        if (a[R].opt == 2)
            if (a[R].z <= a[Max].z) aans[a[R].tim] = a[Max].tim;
        b[cnt++] = a[R++];
    }
    while (L <= mid) 
        b[cnt++] = a[L++];
    for (int i = l; i <= r; i++) a[i] = b[i];
}
int jump(int x, int step) {
    for (int i = 20; i >= 0; i--)
        if ((step >> i) & 1) x = fa[x][i];
    return x;
}
int ans[MAXN][3], Ans[MAXN][3];
int main() {
    N = read();
    for (int i = 1; i < N; i++) {
        int u = read(), v = read();
        add(u, v), add(v, u);
    }
    dfs(1, 0), Dfs(1, 0);
    dfs1(1, 0), dfs2(1, 0);
    for (int i = 1; i <= N; i++) {
        vector<pii>D; D.clear();
        for (int j = 0; j <= 3; j++) D.emplace_back(f[i][j], to[i][j]);
        sort(D.begin(), D.end(), [](pii x, pii y) {
            return x.fir > y.fir;
        });
        for (int j = 0; j <= 2; j++) f[i][j] = D[2 - j].fir, to[i][j] = D[2 - j].sec;
    }
    for (int i = 1; i <= N; i++)
        a[i] = (Node) { 1, f[i][0], f[i][1], f[i][2], i };
    Q = read();
    for (int i = 1; i <= Q; i++) {
        int x = read(), y = read(), z = read(); static int p[3]; q[i] = (Query) {x, y, z};
        p[0] = (y + z - x) / 2, p[1] = (x + z - y) / 2, p[2] = (x + y - z) / 2;
        sort(p, p + 3);
        a[N + i] = (Node) { 2, p[0], p[1], p[2], i };
    }
    sort(a + 1, a + N + Q + 1, [](Node x, Node y) {
        return x.x != y.x ? x.x > y.x : (x.y != y.y ? x.y > y.y : (x.z != y.z ? x.z > y.z : x.opt < y.opt));
    });
    a[0] = (Node) { 1, -1, -1, -1, 0 };
    cdq(1, N + Q);
    for (int i = 1; i <= Q; i++) {
        assert(aans[i]);
        int u = aans[i]; static int p[4];
        int x = q[i].x, y = q[i].y, z = q[i].z;
        p[0] = (y + z - x) / 2, p[1] = (x + z - y) / 2, p[2] = (x + y - z) / 2;
        sort(p, p + 3);
        for (int j = 0; j <= 2; j++) {
            if (p[j] == 0) {
                ans[i][j] = u;
                continue;
            } 
            if (fa[to[u][j]][0] == u) {
                ans[i][j] = rnk[dfn[to[u][j]] + p[j] - 1];
            } else {
                if (dep[u] - dep[to[u][j]] == f[u][j]) {
                    ans[i][j] = jump(u, p[j]);               
                } else {
                    int v = fa[to[u][j]][0];
                    if (dep[u] - dep[v] >= p[j])
                        ans[i][j] = jump(u, p[j]);
                    else
                        ans[i][j] = rnk[dfn[to[u][j]] + p[j] - (dep[u] - dep[v]) - 1];
                }
            }
        }
        for (int j = 0; j <= 2; j++) p[j] = j;
        do {
            bool flag = true;
            flag &= dis(ans[i][p[0]], ans[i][p[1]]) == x;
            flag &= dis(ans[i][p[0]], ans[i][p[2]]) == y;
            flag &= dis(ans[i][p[1]], ans[i][p[2]]) == z;
            if (flag) {
                for (int j = 0; j <= 2; j++)
                    Ans[i][j] = ans[i][p[j]];
                break;
            }
            //cerr << p[0] << " " << p[1] << " " << p[2] << "\n";
        } while (next_permutation(p, p + 3));
    }
    for (int i = 1; i <= Q; i++) {
        for (int j = 0; j <= 2; j++)
            printf("%d ", Ans[i][j]);
        printf("\n");
    }
}