//qoj5828
#include <bits/stdc++.h>
using namespace std; typedef long long ll; namespace FastIO {
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
INLINE_V constexpr int _READ_SIZE = 1 << 18; INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
inline char gc() { if (__builtin_expect(_read_ptr == _read_ptr_end, false)) { _read_ptr = _read_buffer; _read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin); if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;} return *_read_ptr++; }
INLINE_V constexpr int _WRITE_SIZE = 1 << 18; INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer; inline void pc(char c) { *_write_ptr++ = c; if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); _write_ptr = _write_buffer; } }
INLINE_V struct _auto_flush { ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); } } _auto_flush; inline bool _isdigit(char c) { return (c & 16) && c != EOF; } inline bool _isgraph(char c) { return c > 32 && c != EOF; }
template <class T> INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer; template <class T> INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed; template <class T> INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <> INLINE_V constexpr bool _is_integer<__int128> = true; template <> INLINE_V constexpr bool _is_integer<__uint128_t> = true; template <> INLINE_V constexpr bool _is_signed<__int128> = true; template <> INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
inline void read(char &c) { do c = gc(); while (!_isgraph(c)); } inline void read_cstr(char *s) { char c = gc(); while (!_isgraph(c)) c = gc(); while (_isgraph(c)) *s++ = c, c = gc(); *s = 0; } inline void read(string &s) { char c = gc(); s.clear(); while (!_isgraph(c)) c = gc(); while (_isgraph(c)) s.push_back(c), c = gc(); }
template <class T, enable_if_t<_is_signed<T>, int> = 0> inline void read(T &x) { char c = gc(); bool f = true; x = 0; while (!_isdigit(c)) { if (c == 45) f = false; c = gc(); }
if (f) while (_isdigit(c)) x = x * 10 + (c & 15), c = gc(); else while (_isdigit(c)) x = x * 10 - (c & 15), c = gc(); } template <class T, enable_if_t<_is_unsigned<T>, int> = 0> inline void read(T &x) { char c = gc(); while (!_isdigit(c)) c = gc(); x = 0; while (_isdigit(c)) x = x * 10 + (c & 15), c = gc(); }
inline void write(char c) { pc(c); } inline void write_cstr(const char *s) { while (*s) pc(*s++); } inline void write(const string &s) { for (char c : s) pc(c); } template <class T, enable_if_t<_is_signed<T>, int> = 0> inline void write(T x) { char buffer[numeric_limits<T>::digits10 + 1]; int digits = 0; if (x >= 0) do buffer[digits++] = (x % 10) | 48, x /= 10; while (x);
else { pc(45); do buffer[digits++] = -(x % 10) | 48, x /= 10; while (x); } while (digits) pc(buffer[--digits]); } template <class T, enable_if_t<_is_unsigned<T>, int> = 0> inline void write(T x) { char buffer[numeric_limits<T>::digits10 + 1]; int digits = 0; do buffer[digits++] = (x % 10) | 48, x /= 10; while (x); while (digits) pc(buffer[--digits]); }
template <int N> struct _tuple_io_helper { template <class... T> static inline void _read(tuple<T...> &x) { _tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x)); } template <class... T> static inline void _write(const tuple<T...> &x) { _tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x)); } };
template <> struct _tuple_io_helper<1> { template <class... T> static inline void _read(tuple<T...> &x) { read(get<0>(x)); } template <class... T> static inline void _write(const tuple<T...> &x) { write(get<0>(x)); } };
template <class... T> inline void read(tuple<T...> &x) { _tuple_io_helper<sizeof...(T)>::_read(x); } template <class... T> inline void write(const tuple<T...> &x) { _tuple_io_helper<sizeof...(T)>::_write(x); }
template <class T1, class T2> inline void read(pair<T1, T2> &x) { read(x.first), read(x.second); } template <class T1, class T2> inline void write(const pair<T1, T2> &x) { write(x.first), pc(32), write(x.second); }
template <class T1, class... T2> inline void read(T1 &x, T2 &...y) { read(x), read(y...); } template <class... T> inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
template <class T1, class... T2> inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); } template <class... T> inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
template <class T> inline void print(const T &x) { write(x); } inline void print_cstr(const char *x) { write_cstr(x); } template <class T1, class... T2> inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
template <class... T> inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); } inline void println() { pc(10); } inline void println_cstr() { pc(10); }
template <class... T> inline void println(const T &...x) { print(x...), pc(10); } template <class... T> inline void printk(const T &...x) { print(x...), pc(32); } template <class... T> inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); } } using namespace FastIO; void solve();int main(){ solve(); return 0; }

const int N = 2e5 + 10;
int n, q, dep[N], mxd[N], mxo[N], f[N][4], fat[N][20];
int qu[N], qv[N], qw[N], au[N], av[N], aw[N], t[N*4], rt[N*4];
vector<pair<int, pair<int, int> > > ad[N], qr[N];
pair<int, int> fr[N][4];
vector<int> g[N];

void dfs1(int x, int fa){
	mxd[x] = dep[x] = dep[fa] + 1;
	mxo[x] = x;
	fat[x][0] = fa;
	for(int i = 1; i < 20; ++ i){
		fat[x][i] = fat[fat[x][i-1]][i-1];
	}
	for(int y : g[x]){
		if(y == fa){
			continue;
		}
		dfs1(y, x);
		pair<int, pair<int, int> > tmp[5];
		for(int i = 0; i < 4; ++ i){
			tmp[i] = make_pair(f[x][i], fr[x][i]);
		}
		tmp[4] = make_pair(mxd[y], make_pair(y, mxo[y]));
		sort(tmp, tmp + 5);
		reverse(tmp, tmp + 5);
		for(int i = 0; i < 4; ++ i){
			tie(f[x][i], fr[x][i]) = tmp[i];
		}
		if(mxd[y] > mxd[x]){
			mxd[x] = mxd[y];
			mxo[x] = mxo[y];
		}
	}
}
void dfs2(int x, int fa){
	for(int y : g[x]){
		if(y == fa){
			continue;
		}
		pair<int, pair<int, int> > tmp[5];
		for(int i = 0; i < 4; ++ i){
			tmp[i] = make_pair(max(0, f[y][i] - dep[y]), fr[y][i]);
		}
		if(fr[x][0].first != y){
			tmp[4] = make_pair(f[x][0] + 1, make_pair(x, fr[x][0].second));
		} else {
			tmp[4] = make_pair(f[x][1] + 1, make_pair(x, fr[x][1].second));
		}
		sort(tmp, tmp + 5);
		reverse(tmp, tmp + 5);
		for(int i = 0; i < 4; ++ i){
			tie(f[y][i], fr[y][i]) = tmp[i];
		}
		dfs2(y, x);
	}
}
int lca(int x, int y){
	if(dep[x] < dep[y]){
		swap(x, y);
	}
	for(int i = 19; i >= 0; -- i){
		if(dep[fat[x][i]] >= dep[y]){
			x = fat[x][i];
		}
	}
	if(x == y){
		return x;
	}
	for(int i = 19; i >= 0; -- i){
		if(fat[x][i] != fat[y][i]){
			x = fat[x][i];
			y = fat[y][i];
		}
	}
	return fat[x][0];
}
int jmp(int x, int d){
	for(int i = 19; i >= 0; -- i){
		if(d & (1 << i)){
			x = fat[x][i];
		}
	}
	return x;
}
int mv(int x, int y, int d){
	int l = lca(x, y);
	if(dep[x] - dep[l] < d){
		d -= dep[x] - dep[l];
		return mv(y, l, dep[y] - dep[l] - d);
	} else {
		return jmp(x, d);
	}
}

void add(int p, int l, int r, int x, int v, int rr){
	if(l == r){
		if(v > t[p]){
			t[p] = v;
			rt[p] = rr;
		}
	} else {
		int mid = l + r >> 1;
		if(x <= mid){
			add(p<<1, l, mid, x, v, rr);
		} else {
			add(p<<1|1, mid+1, r, x, v, rr);
		}
		if(t[p<<1] > t[p<<1|1]){
			t[p] = t[p<<1];
			rt[p] = rt[p<<1];
		} else {
			t[p] = t[p<<1|1];
			rt[p] = rt[p<<1|1];
		}
	}
}
pair<int, int> ask(int p, int l, int r, int ql, int qr){
	if(qr < l || r < ql){
		return make_pair(-114, 0);
	} else if(ql <= l && r <= qr){
		return make_pair(t[p], rt[p]);
	} else {
		int mid = l + r >> 1;
		return max(ask(p<<1, l, mid, ql, qr), ask(p<<1|1, mid+1, r, ql, qr));
	}
}

void solve(){
	read(n);
	for(int i = 1; i < n; ++ i){
		int u, v;
		read(u, v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs1(1, 0);
	for(int i = 0; i < 4; ++ i){
		if(f[1][i] > 0){
			-- f[1][i];
		} else {
			f[1][i] = 0;
			fr[1][i] = make_pair(1, 1);
		}
	}
	dfs2(1, 0);
	for(int i = 1; i <= n; ++ i){
		if(!f[i][1]){
			continue;
			fr[i][1] = make_pair(i, i);
		}
		if(!f[i][2]){
			fr[i][2] = make_pair(i, i);
		}
		ad[f[i][0]].emplace_back(f[i][1], make_pair(f[i][2], i));
		ad[f[i][0]].emplace_back(f[i][2], make_pair(f[i][1], i));
		ad[f[i][1]].emplace_back(f[i][0], make_pair(f[i][2], i));
		ad[f[i][1]].emplace_back(f[i][2], make_pair(f[i][0], i));
		ad[f[i][2]].emplace_back(f[i][0], make_pair(f[i][1], i));
		ad[f[i][2]].emplace_back(f[i][1], make_pair(f[i][0], i));
	}
	read(q);
	for(int i = 1; i <= q; ++ i){
		int x, y, z, t[3];
		read(x, y, z);
		t[0] = (x + y - z) / 2;
		t[1] = (x + z - y) / 2;
		t[2] = (y + z - x) / 2;
		qu[i] = t[0];
		qv[i] = t[1];
		qw[i] = t[2];
		qr[t[0]].emplace_back(t[1], make_pair(t[2], i));
	}
	memset(t, -1, sizeof(t));
	for(int i = n; i >= 0; -- i){
		for(auto j : ad[i]){
			add(1, 0, n, j.first, j.second.first, j.second.second);
		}
		for(auto j : qr[i]){
			auto x = ask(1, 0, n, j.first, n);
			if(x.first >= j.second.first){
				au[j.second.second] = x.second;
			}
		}
	}
	for(int i = 1; i <= q; ++ i){
		int r = au[i];
		int a1 = (qu[i] > qv[i] ? 0 : 1) + (qu[i] > qw[i] ? 0 : 1);
		int a2 = (qv[i] >= qu[i] ? 0 : 1) + (qv[i] > qw[i] ? 0 : 1);
		int a3 = (qw[i] >= qu[i] ? 0 : 1) + (qw[i] >= qv[i] ? 0 : 1);
		int x = mv(fr[r][a1].second, r, f[r][a1] - qu[i]);
		int y = mv(fr[r][a2].second, r, f[r][a2] - qv[i]);
		int z = mv(fr[r][a3].second, r, f[r][a3] - qw[i]);
		println(x, y, z);
	}
}