#include <bits/stdc++.h>
#define F(i,l,r) for(int i=(l),i##end=(r);i<=i##end;++i)
#define G(i,l,r) for(int i=(l),i##end=(r);i>=i##end;--i)
#define pii pair<int,int>
#define x first
#define y second
#define mp(x,y) make_pair(x,y)
#define ep emplace_back
using namespace std;
typedef long long ll;
constexpr int N = 5e5;
struct Edge {
    int nxt;
    int to;
} ed[2 * N];
int head[N + 9];
int pp;
void adde(int x, int y) {
    ++pp;
    ed[pp].nxt = head[x];
    ed[pp].to = y;
    head[x] = pp;
}
struct question {
    int id, l, r, k;
} q[N + 9];
struct node {
    int l, r, x;
} sk[N + 9];
int dep[N + 9];
int st[20][N + 9];
int dfn[N + 9];
int a[N + 9];
int n, dfntot;
void dfs(int x, int fa) {
    dep[x] = dep[fa] + 1;
    st[0][dfn[x] = ++dfntot] = dep[fa];

    for (int i = head[x], u = ed[i].to; i; u = ed[i = ed[i].nxt].to)
        if (u != fa)
            dfs(u, x);
}
int ask(int x) {
    int u = dfn[x], v = dfn[x + 1];

    if (u > v)
        swap(u, v);

    int l = __lg(v - u++);
    return min(st[l][u], st[l][v - (1 << l) + 1]);
}
void init() {
    F(i, 1, __lg(n))F(j, 1, n - (1 << i) + 1) st[i][j] = min(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
    F(i, 1, n - 1) sk[i].x = a[i] = ask(i);
    int stk[N + 9], top = 0;
    stk[0] = 0;
    F(i, 1, n - 1) {
        while (top && a[stk[top]] >= a[i])
            sk[stk[top--]].r = i - 1;

        sk[i].l = stk[top] + 1;
        stk[++top] = i;
    }
    F(i, 1, top) sk[stk[i]].r = n - 1;
}
void chkmin(int &x, int y) {
    if (y < x)
        x = y;
}
void chkmax(int &x, int y) {
    if (y > x)
        x = y;
}
namespace zkw {
int tr[1 << 21], n;
void init(int n_) {
    n = 1;

    while (n <= n_)
        n <<= 1;

    memset(tr, 0, sizeof(int) * (2 * n + 1));
}
void modify(int x, int y) {
    if (tr[x += n] < y)
        tr[x] = y;
    else
        return ;

    for (; x >>= 1;)
        tr[x] = max(tr[x << 1], tr[x << 1 | 1]);
}
int ask(int l, int r) {
    int ans = 0;

    for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
        if (l & 1)
            ans = max(ans, tr[l++]);

        if (r & 1)
            ans = max(ans, tr[--r]);
    }

    return ans;
}
}
int out[N + 9];
int m;
namespace solve {
int st[20][N + 9];
void main() {
    F(i, 1, n) st[0][i] = dep[i];
    F(i, 1, __lg(n))F(j, 1, n - (1 << i) + 1)st[i][j] = max(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);

    F(i, 1, m)if (q[i].k == 0) {
        q[i].r++;
        int l = __lg(q[i].r - q[i].l + 1);
        out[i] = max(st[l][q[i].l], st[l][q[i].r - (1 << l) + 1]);
    }
}
}
void read(int &x) {
    x = 0;
    char ch = getchar();

    while (ch < '0' || ch > '9')
        ch = getchar();

    while (ch >= '0' && ch <= '9')
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
}
char hi[10];
int hii;
void write(int x) {
    hii = 0;

    while (x)
        hi[++hii] = x % 10, x /= 10;

    G(i, hii, 1)putchar(hi[i] + '0');
}
int main() {
    freopen("query.in", "r", stdin);
    freopen("query.out", "w", stdout);
    read(n);
    F(i, 1, n - 1) {
        int u, v;
        read(u);
        read(v);
        adde(u, v);
        adde(v, u);
    }
    dfs(1, 0);
    read(m);
    F(i, 1, m)q[i].id = i, read(q[i].l), read(q[i].r), read(q[i].k), q[i].k--, q[i].r--;
    solve::main();
    init();
    sort(q + 1, q + m + 1, [](const question & a, const question & b) {
        return a.k > b.k;
    });
    sort(sk + 1, sk + n, [](const node & a, const node & b) {
        return a.r - a.l > b.r - b.l;
    });
    zkw::init(n);
    int tot = 0;
    F(i, 1, m) {
        if (!q[i].k)
            break;

        while (tot < n && sk[tot + 1].r - sk[tot + 1].l + 1 >= q[i].k) {
            ++tot;
            zkw::modify(sk[tot].l, sk[tot].x);
        }

        chkmax(out[q[i].id], zkw::ask(q[i].l, q[i].r - q[i].k + 1));
    }
    sort(q + 1, q + m + 1, [](const question & a, const question & b) {
        return a.l < b.l;
    });
    sort(sk + 1, sk + n, [](const node & a, const node & b) {
        return a.l < b.l;
    });
    zkw::init(n);
    tot = 0;
    F(i, 1, m) {
        if (!q[i].k)
            continue;

        while (tot < n && sk[tot + 1].l <= q[i].l) {
            ++tot;
            zkw::modify(sk[tot].r, sk[tot].x);
        }

        chkmax(out[q[i].id], zkw::ask(q[i].l + q[i].k - 1, n));
    }
    F(i, 1, m)write(out[i]), putchar('\n');
    return 0;
}