#include <bits/stdc++.h>
using namespace std;
namespace Fread  { const int SIZE = (1 << 18); char buf[SIZE], *p1 = buf, *p2 = buf; inline char getchar() {return (p1 == p2 and (p2 = (p1 = buf) + fread(buf, 1, SIZE, stdin), p1 == p2) ? EOF : *p1++);} }
namespace Fwrite { const int SIZE = (1 << 18); char buf[SIZE], *S = buf, *T = buf+SIZE; inline void flush(){ fwrite(buf, 1, S-buf, stdout), S = buf; }  struct NTR{ ~NTR() { flush(); } }ztr;inline void putchar(char c){ *S++ = c; if(S == T) flush(); } }
#ifdef ONLINE_JUDGE
	#define getchar Fread::getchar
	#define putchar Fwrite::putchar
#endif
namespace Fastio{
	struct Reader{ template <typename T> Reader & operator >> (T & x) {char c = getchar(); bool f = false;while (c < '0' or c > '9') { if (c == '-') f = true;c = getchar();} x = 0;while(c >= '0' and c <= '9'){x = (x<<1)+(x<<3)+(c^48);c = getchar();} if (f) x = -x;return *this;}Reader&operator>>(char&c){ c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){ int len=0;char c=getchar(); while(c=='\n'||c==' '||c=='\r')c=getchar(); while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar(); str[len]='\0'; return *this;}Reader(){}}cin;
	struct Writer{ template <typename T> Writer & operator << (T   x) {if(x == 0) return putchar('0'), *this;if(x < 0) putchar('-'), x = -x;static int sta[45], top = 0; while (x)  sta[++top] = x %10, x /= 10; while (top)  putchar(sta[top] + '0'), --top; return *this;} Writer&operator<<(char c){putchar(c);return*this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer(){}}cout;
}   const char endl = '\n'; 
#define cin  Fastio :: cin
#define cout Fastio :: cout
#define inline __attribute__((__gnu_inline__, __always_inline__, __artificial__)) inline
using pii = pair<int,int>; using vi = vector<int>; using vp = vector<pii>; using ll = long long; 
using ull = unsigned long long; using db = double; using ld = long double; using lll = __int128_t;
template<typename T1, typename T2> T1 max(T1 a, T2 b) { return a > b ? a : b; }
template<typename T1, typename T2> T1 min(T1 a, T2 b) { return a < b ? a : b; }
#define multi int _T_; cin >> _T_; for (int TestNo = 1; TestNo <= _T_; ++ TestNo)
#define timer cerr << 1. * clock() / CLOCKS_PER_SEC << '\n';
#define iot ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
#define rep(i,s,t) for (register int i = (s), i##_ = (t) + 1; i < i##_; ++ i)
#define pre(i,s,t) for (register int i = (s), i##_ = (t) - 1; i > i##_; -- i)
#define eb emplace_back
#define pb pop_back
const int N = 4e5 + 10;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3fll;
int n, m, t1, t2, x, y, z, ans[N], dep[N], idfn[N], tmp[3], ttt[N][3];
pii mxv1[N][3], mxv2[N][3];
vi g[N];

struct elem { 
    int id, typ; 
    pii a[3]; 
} el[N];

struct sgt {
    #define ls (p << 1)
    #define rs (p << 1 | 1)
    #define lzy(p) seg[p].lzy
    #define mxv(p) seg[p].mxv

    struct node {
        int lzy; pii mxv;
    } seg[N << 2];

    inline void ps_d(int p) {
        if (!lzy(p)) return;
        lzy(ls) += lzy(p), mxv(ls).first += lzy(p);
        lzy(rs) += lzy(p), mxv(rs).first += lzy(p);
        lzy(p) = 0;
    }

    void build(int p, int l, int r) {
        if (l == r) return void(mxv(p) = pii(dep[idfn[l]], idfn[l])); 
        int mid = l + r >> 1;
        build(ls, l, mid), build(rs, mid + 1, r);
        mxv(p) = max(mxv(ls), mxv(rs));
    }

    void update(int p, int l, int r, int L, int R, int va) {
        if (L > R) return;
        if (L <= l and r <= R) return lzy(p) += va, mxv(p).first += va, void();
        int mid = l + r >> 1; ps_d(p);
        if (L <= mid) update(ls, l, mid, L, R, va);
        if (mid < R) update(rs, mid + 1, r, L, R, va);
        mxv(p) = max(mxv(ls), mxv(rs));
    }

    pii query(int p, int l, int r, int L, int R) {
        if (L > R) return pii(0, 0);
        if (L <= l and r <= R) return mxv(p); 
        int mid = l + r >> 1; pii ret = { -1, -1 }; ps_d(p);
        if (L <= mid) ret = max(ret, query(ls, l, mid, L, R));
        if (mid < R) ret = max(ret, query(rs, mid + 1, r, L, R));
        return ret;
    }
} Tr;

struct fenwick {
    pii Index[N];
    inline pii query(int p, pii ret = pii(0, 0)) { 
        for (p++; p <= n; p += p & -p) ret = max(ret, Index[p]); 
        return ret; 
    }
    inline void update(int p, pii va) { 
        for (p++; p; p ^= p & -p) Index[p] = max(Index[p], va); 
    }
} fw;

int fa[N][21], siz[N], dfn[N], stp;
void dfs1(int u, int ft) {
    dfn[u] = ++ stp, idfn[stp] = u, siz[u] = 1;
    fa[u][0] = ft; rep(i, 1, 20) fa[u][i] = fa[fa[u][i - 1]][i - 1];
    for (auto v : g[u]) if (v != ft) {
        dep[v] = dep[u] + 1, dfs1(v, u), siz[u] += siz[v];
    }
}

void dfs2(int u, int ft) {
    vp s; s.assign(3, { 0, u });
    for (auto v : g[u]) if (v != ft)
        s.eb(Tr.query(1, 1, n, dfn[v], dfn[v] + siz[v] - 1));
    s.eb(max(Tr.query(1, 1, n, 1, dfn[u] - 1), Tr.query(1, 1, n, dfn[u] + siz[u], n)));
    sort(s.begin(), s.end(), greater<>()); 
    rep(i, 0, 2) el[u].a[i] = mxv2[u][i] = s[i]; el[u].id = u;
    Tr.update(1, 1, n, 1, dfn[u] - 1, 1), Tr.update(1, 1, n, dfn[u] + siz[u], n, 1);
    for (auto v : g[u]) if (v != ft) {
        Tr.update(1, 1, n, dfn[v], dfn[v] + siz[v] - 1, -1);
        dfs2(v, u);
        Tr.update(1, 1, n, dfn[v], dfn[v] + siz[v] - 1, 1);
    } Tr.update(1, 1, n, 1, dfn[u] - 1, - 1), Tr.update(1, 1, n, dfn[u] + siz[u], n, - 1);
}

int lca(int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    pre(i, 20, 0) if (dep[fa[u][i]] >= dep[v]) u = fa[u][i];
    if (u == v) return u;
    pre(i, 20, 0) if (fa[u][i] != fa[v][i]) u = fa[u][i], v = fa[v][i];
    return fa[u][0];
}

int dis(int a, int b) { return dep[a] + dep[b] - 2 * dep[lca(a, b)]; }

int query(int u, int v, int dis) {
    int LCA = lca(u, v);
    if (dep[u] - dep[LCA] >= dis) {
        pre(i, 20, 0) if (fa[u][i] and dep[u] - dep[fa[u][i]] <= dis) dis -= dep[u] - dep[fa[u][i]], u = fa[u][i];
        return u;
    } else {
        dis -= dep[u] - dep[LCA];
        pre(i, 20, 0) if (fa[v][i] and dep[fa[v][i]] - dep[LCA] >= dis) v = fa[v][i];
        return v;
    }
}

signed main() {
    cin >> n;
    rep(i,2,n) cin >> t1 >> t2, g[t1].eb(t2), g[t2].eb(t1);
    dfs1(1, 0);
    Tr.build(1, 1, n);
    dfs2(1, 0);
    cin >> m;
    rep(i,1,m) {
        cin >> x >> y >> z; int s = (x + y + z) / 2; ttt[i][0] = x, ttt[i][1] = y, ttt[i][2] = z;
        mxv1[i][0] = pii(s - z, 0), mxv1[i][1] = pii(s - y, 1), mxv1[i][2] = pii(s - x, 2);
        sort(mxv1[i], mxv1[i] + 3, greater<>());
        rep(j, 0, 2) el[i + n].a[j] = mxv1[i][j];
        el[i + n].id = i, el[i + n].typ = 1;
    }
    sort(el + 1, el + n + m + 1, [&](auto a, auto b) {
        if (a.a[0].first == b.a[0].first) return a.typ < b.typ;
        return a.a[0].first > b.a[0].first;
    });
    rep(i,1,n + m) {
        if (el[i].typ == 0) fw.update(el[i].a[1].first, pii(el[i].a[2].first, el[i].id));
        else ans[el[i].id] = fw.query(el[i].a[1].first).second;
    }
    rep(i,1,m) {
        int x = ans[i];
        rep(j, 0, 2) tmp[mxv1[i][j].second] = query(x, mxv2[x][j].second, mxv1[i][j].first);
        if (*min_element(tmp, tmp + 3) == 0) {
            rep(u,1,n) rep(v,1,n) rep(w,1,n) if (dis(u, v) == ttt[i][0] and dis(u, w) == ttt[i][1] and dis(v, w) == ttt[i][2]) {
                cout << u << ' ' << v << ' ' << w << '\n';
                goto V;
            } V:;
        } else {
            rep(j, 0, 2) cout << tmp[j] << ' '; cout << '\n';
        }
    }
}