#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>

#define ll long long

using namespace std;

const int N = 200005;

int n, t, x, y, d, st, ed, m, bl, k[N], dp[N], vis[N], a[N], sx, sy, sz, s1, s2, s3;
vector<int> g[N], ans[N];

struct h {
	int s;
	int id;
} tr[N << 2];

void dfs(int u, int fa, int dep) {
	if (dep >= m) m = dep, d = u;
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (v == fa) continue;
		dfs(v, u, dep + 1);
	}
}

void work(int u, int fa, int dep) {
	if (bl) return;
	k[dep] = u;
	if (u == ed) {
		bl = 1;
		m = dep;
		return;
	}
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (v == fa) continue;
		work(v, u, dep + 1);
	}
}

void DP(int u, int fa) {
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (v == fa || vis[v]) continue;
		DP(v, u);
		dp[u] = max(dp[u], dp[v] + 1);
	}
}

void build(int l, int r, int rt) {
	if (l == r) {tr[rt] = (h) {a[l], l}; return; }
	int mid = (l + r) >> 1;
	build(l, mid, rt << 1), build(mid + 1, r, rt << 1 | 1), tr[rt] = (tr[rt << 1].s > tr[rt << 1 | 1].s ? tr[rt << 1] : tr[rt << 1 | 1]);
}

h ask(int ln, int rn, int l, int r, int rt) {
	if (ln > rn) return (h) {(int)-1e9, 0};
	if (l >= ln && r <= rn) return tr[rt];
	int mid = (l + r) >> 1;
	h maxn = {(int)-1e9, 0};
	if (ln <= mid) {
		h p = ask(ln, rn, l, mid, rt << 1);
		if (p.s > maxn.s) maxn = p;
	}
	if (rn > mid) {
		h p = ask(ln, rn, mid + 1, r, rt << 1 | 1);
		if (p.s > maxn.s) maxn = p;
	}
	return maxn;
}

void answer(int u, int fa, int p, int dep) {
	if (bl) return;
	ans[p].push_back(u);
	if (dep == dp[p]) {
		bl = 1;
		return;
	}
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (v == fa || vis[v]) continue;
		answer(v, u, p, dep + 1);
	}
	if (!bl) ans[p].pop_back();
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i < n; i++) cin >> x >> y, g[x].push_back(y), g[y].push_back(x);
	dfs(1, 0, 0), st = d, d = m = 0, dfs(st, 0, 0), ed = d;
	m = 0, work(st, 0, 1);
	for (int i = 1; i <= m; i++) vis[k[i]] = 1;
	for (int i = 1; i <= m; i++) DP(k[i], 0);
	for (int i = 1; i <= m; i++) a[i] = dp[k[i]];
	for (int i = 1; i <= m; i++) bl = 0, answer(k[i], 0, k[i], 0);
	build(1, m, 1);
	cin >> t;
	while (t--) {
		cin >> sx >> sy >> sz;
		s1 = (sx + sy + sz) / 2 - sz;
		s2 = (sx + sy + sz) / 2 - sy;
		s3 = (sx + sy + sz) / 2 - sx;
		h a = ask(s1 + 1, m - s2, 1, m, 1), b = ask(s1 + 1, m - s3, 1, m, 1), c = ask(s2 + 1, m - s3, 1, m, 1), aa = ask(s2 + 1, m - s1, 1, m, 1), bb = ask(s3 + 1, m - s1, 1, m, 1), cc = ask(s3 + 1, m - s2, 1, m, 1);
		if (a.s >= s3) cout << k[a.id - s1] << ' ' << k[a.id + s2] << ' ' << ans[k[a.id]][s3] << '\n';
		else if (aa.s >= s3) cout << k[aa.id + s1] << ' ' << k[aa.id - s2] << ' ' << ans[k[aa.id]][s3] << '\n';
		else if (b.s >= s2) cout << k[b.id - s1] << ' ' << ans[k[b.id]][s2] << ' ' << k[b.id + s3] << '\n';
		else if (bb.s >= s2) cout << k[bb.id + s1] << ' ' << ans[k[bb.id]][s2] << ' ' << k[bb.id - s3] << '\n';
		else if (c.s >= s1) cout << ans[k[c.id]][s1] << ' ' << k[c.id - s2] << ' ' << k[c.id + s3] << '\n';
		else if (cc.s >= s1) cout << ans[k[cc.id]][s1] << ' ' << k[cc.id + s2] << ' ' << k[cc.id - s3] << '\n';
	}
	return 0;
}