#include<bits/stdc++.h>
using namespace std;
const long long MaxN = 1e5 + 5, LOG= 17;
long long n,q, par[MaxN][LOG], d[MaxN];
vector<long long> vt[MaxN];
void dfs(long long u)
{
    for(long long v : vt[u])
    {
        if(v!=par[u][0])
        {
            par[v][0]=u;
            d[v]=d[u]+1;
            dfs(v);
        }
    }
}
long long lca(long long u, long long v)
{
    if(d[u]<d[v]) swap(u,v);

    //cân bằng độ sâu
    for (long long i=LOG-1; i>=0; i--)
    {
        if(d[par[u][i]]>=d[v])
        {
            u=par[u][i];
        }
    }
    if(u==v) return u;
    //cùng đi lên
    for (long long i=LOG-1; i>=0; i--)
    {
        if(par[u][i]!=par[v][i])
        {
            u=par[u][i];
            v=par[v][i];
        }
    }
    return par[u][0];
}
void input()
{
    cin >> n >> q;
    for (long long i=1; i<n; i++)
    {
        long long u,v;
        cin >> u >> v;
        vt[u].push_back(v);
        vt[v].push_back(u);
    }
}
void solve()
{
    dfs(1);
    for (long long j=1; j<LOG; j++)
    {
        for (long long i=1; i<=n; i++)
        {
            par[i][j]=par[par[i][j-1]][j-1];
        }
    }
    d[0]=-1;
    for (long long i=1; i<=q; i++)
    {
        long long u,v, w;
        cin >> u >> v >> w;
       long long l = lca(u,v);
        long long len1 = d[u]-d[l];
        long long len = d[u]+d[v]-2*d[l];

        if(w<=len1)
        {
            for(long long i=0; i<LOG; i++)
            {
                if((w>>i)&1)
                {
                    u=par[u][i];
                }
            }
            cout << u << "\n";
        }
        else
        {
            if(w>=len)
            {
                cout << v << "\n";
                continue;
            }

            long long new_w = len-w;

            for(long long i=0; i<LOG; i++)
            {
                if((new_w>>i)&1)
                {
                    v=par[v][i];
                }
            }

            cout << v << "\n";
        }
    }

}
int main()
{
    input();
    solve();
}