#include<bits/stdc++.h>
using namespace std;
// #define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define each(i, v) for(auto i : v)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define Debug debug("Passing [%s] in LINS %d\n", __FUNCTION__, __LINE__)
#define pb push_back
#define fi first
#define se second
#define Mry debug("%.3lf MB\n", (&Mbe - &Med) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;


namespace GAME {
	int n, q;
	vi d[_];
	namespace Tree {
		int f[20][_], dep[_];
		void dfs(int u, int fa) {
			dep[u] = dep[fa] + 1, f[0][u] = fa;
			for(int v : d[u]) if(v != fa) dfs(v, u);
		}
		void init() {
			dfs(1, 0);
			F(i, 1, 19) F(j, 1, n) f[i][j] = f[i - 1][f[i - 1][j]];
		}
		int jump(int x, int d) {
//			assert(x), assert(d >= 0), assert(d < dep[x]);
//			cout << "jump : " << x << ' ' << d << ' ';
			dF(i, 19, 0) if((d >> i) & 1) x = f[i][x];
//			cout << x << '\n';
			return x;
		}
		int LCA(int u, int v) {
			if(dep[u] < dep[v]) swap(u, v);
			dF(i, 19, 0) if(dep[f[i][u]] >= dep[v]) u = f[i][u];
			if(u == v) return u;
			dF(i, 19, 0) if(f[i][u] != f[i][v]) u = f[i][u], v = f[i][v];
			return f[0][u];
		}
		int Dis(int u, int v) {
			return dep[u] + dep[v] - (dep[LCA(u, v)] << 1);
		}
	}
	namespace HG {
		struct node {
			int ln, v, v2;
			node() {
			}
			node(int Ln = 0, int V = 0, int V2 = 0) {
				ln = Ln, v = V, v2 = V2;
			}
		};
		vector<node> g[_];
		int len[_], p[_], p2[_];
		int dfs(int u, int fa) {
			g[u].clear();
			len[u] = 0;
			int p = 0;
			for(int v : d[u]) if(v != fa){
				int w = dfs(v, u);
				if(len[u] < len[v] + 1) {
					len[u] = len[v] + 1;
					p = w;
				}
				g[u].pb(node(len[v] + 1, v, w));
			}
			sort(g[u].begin(), g[u].end(), [&](node a, node b) { return a.ln > b.ln; });
			while(g[u].size() > 3) g[u].pop_back();
			while(g[u].size() < 3) g[u].pb(node(0, 0, u));
			if(d[u].size() == 1) return u;
			else return p;
//			while(!g[u].empty() && g[u].back() == 0) g[u].pop_back();
		}
		void dfs2(int u, int fa, int ln) {
			if(fa && ln) {
				g[u].pb(node(ln, fa, 0));
				sort(g[u].begin(), g[u].end(), [&](node a, node b) { return a.ln > b.ln; });
			}
			while(g[u].size() > 3) g[u].pop_back();
			while(g[u].size() < 3) g[u].pb(node(0, 0, 0));
			int nw = 0;
			for(int v : d[u]) if(v != fa) {
				nw = 0;
				if(g[u][0].v == v) nw = g[u][1].ln;
				else nw = g[u][0].ln;
				dfs2(v, u, nw + 1);
			}
		}
		void init() {
			dfs(1, 0), dfs2(1, 0, 0);
		}
	}
	namespace CDQ {
		int as[_];
		struct qry {
			int x, y, z, d, a, b, c; // a--u, b -- v, c -- w
			vector<pii> g;
			int pos[3];
			qry() {}
			qry(int X, int Y, int Z) {
				x = X, y = Y, z = Z;
				d = (x + y + z) / 2;
				a = d - z, b = d- y, c = d - x;
				g.pb({a, 0}), g.pb({b, 1}), g.pb({c, 2});
				sort(g.begin(), g.end(), [&](pii a, pii b) { return a > b; });
				F(i, 0, 2) pos[g[i].se] = i;
			}
		} qr[_];
		// find u, st. g[u][0] >= a, g[u][1] >= b, g[u][c] >= c
		void init() {
			F(i, 1, q) {
				F(j, 1, n) if(HG::g[j][0].ln >= qr[i].g[0].fi && HG::g[j][1].ln >= qr[i].g[1].fi && HG::g[j][2].ln >= qr[i].g[2].fi) {
					as[i] = j; break;
				}
			}
		}
	}
	namespace Gas {
		int ans[_][3];
		void init() {
			F(i, 1, q) {
				int x = CDQ::as[i];
				F(j, 0, 2) {
					assert(HG::g[x][j].ln >= CDQ::qr[i].g[j].fi);
					if(HG::g[x][j].v2 == 0) {
						cout << HG::g[x][j].ln << ' ' << HG::g[x][j].v << ' ' << HG::g[x][j].v2 << ' ' << Tree::f[0][x] << ' ' << CDQ::qr[i].g[j].fi << '\n';
//						assert((HG::g[x][j].ln == 0 && HG::g[x][j].v == 0) || (HG::g[x][j].v == Tree::f[x][0] && HG::g[x][j].ln > 0));
						ans[i][j] = Tree::jump(x, CDQ::qr[i].g[j].fi);
//					if(!ans[i][j]) ans[i][j] = x;
					} else {
						ans[i][j] = Tree::jump(HG::g[x][j].v2, HG::g[x][j].ln - CDQ::qr[i].g[j].fi);
//					if(!ans[i][j]) ans[i][j] = x;
					}
				}
			}
			F(i, 1, q) cout << ans[i][CDQ::qr[i].pos[0]] << ' ' << ans[i][CDQ::qr[i].pos[1]] << ' ' << ans[i][CDQ::qr[i].pos[2]] << '\n';
		}
	}
} using namespace GAME;
bool Med;
signed main() {
	// Mry;
	n = ri();
	F(i, 1, n - 1) {
		int u = ri(), v  =ri();
		d[u].pb(v), d[v].pb(u);
	}
	Tree::init(), HG::init();
	q = ri();
	F(i, 1, q) {
		int x = ri(), y = ri(), z = ri();
		CDQ::qr[i] = CDQ::qry(x, y, z);
	}
	CDQ::init();
	Gas::init();
	// Try;
	return 0;
}