//#ifdef DEBUG
//#define _GLIBCXX_DEBUG
//#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

typedef long long ll;
typedef long double ld;
const int maxN = 2e5 + 10;
int n, q;

vector<int> g[maxN];
int h[maxN];
const int LOG = 19;
int up[LOG][maxN];
void dfs(int v, int p) {
    for (int to : g[v]) {
        if (to == p) continue;
        h[to] = h[v] + 1;
        up[0][to] = v;
        dfs(to, v);
    }
}
int lca(int a, int b) {
    if (h[a] < h[b]) swap(a, b);
    for (int k = LOG - 1; k >= 0; k--) {
        if (h[a] - (1 << k) >= h[b]) a = up[k][a];
    }
    if (a == b) return a;
    for (int k = LOG - 1; k >= 0; k--) {
        if (up[k][a] != up[k][b]) {
            a = up[k][a];
            b = up[k][b];
        }
    }
    return up[0][a];
}
int dist(int x, int y) {
    return h[x] + h[y] - 2 * h[lca(x, y)];
}
pair<int,int> mrg(pair<int,int> a, int x) {
    int D = dist(a.first, a.second);
    int D1 = dist(a.first, x);
    int D2 = dist(a.second, x);
    if (D2 >= D1 && D2 > D) {
        a.first = x;
    }
    else if (D1 > D2 && D1 > D) {
        a.second = x;
    }
    return a;
}
pair<int,int> sub[maxN];
void dfs1(int v, int p) {
    sub[v] = {v, v};
    for (int to : g[v]) {
        if (to == p) continue;
        dfs1(to, v);
        sub[v] = mrg(sub[v], sub[to].first);
        sub[v] = mrg(sub[v], sub[to].second);
    }
}
pair<int,int> up_sub[maxN];
void dfs2(int v, int p) {
    vector<int> sons;
    for (int to : g[v]) {
        if (to == p) continue;
        sons.emplace_back(to);
    }
    vector<pair<int,int>> pref(sons.size() + 1, make_pair(v, v));
    if (v != 1) {
        pref[0] = mrg(pref[0], up_sub[v].first);
        pref[0] = mrg(pref[0], up_sub[v].second);
    }
//    if (v == 2) {
//        cout << pref[0].first << " " << pref[0].second << " ??? " << " " << up_sub[v].first << " " << up_sub[v].second << endl;
//    }
    vector<pair<int,int>> suf(sons.size() + 1, make_pair(v, v));
    for (int z = 0; z < sons.size(); z++) {
        pref[z + 1] = pref[z];
        pref[z + 1] = mrg(pref[z + 1], sub[sons[z]].first);
        pref[z + 1] = mrg(pref[z + 1], sub[sons[z]].second);
    }
    for (int z = sons.size() - 1; z >= 0; z--) {
        suf[z] = suf[z + 1];
        suf[z] = mrg(suf[z], sub[sons[z]].first);
        suf[z] = mrg(suf[z], sub[sons[z]].second);
    }
    for (int z = 0; z < sons.size(); z++) {
        up_sub[sons[z]] = pref[z];
//        if (sons[z] == 3) {
//            cout << pref[z].first << " " << pref[z].second << " CHECK " << endl;
//        }
        up_sub[sons[z]] = mrg(up_sub[sons[z]], suf[z + 1].first);
        up_sub[sons[z]] = mrg(up_sub[sons[z]], suf[z + 1].second);
        dfs2(sons[z], v);
    }
}
int ans(int u, int v, int k) {
    int l = lca(u, v);
//    cout << " HI " << u << " " << v << " " << k << " " << up_sub[2].first << " " << up_sub[2].second <<endl;
    if (k >= h[u] + h[v] - 2 * h[l]) return -1;
    assert(k >= 0 && k <= h[u] + h[v] - 2 * h[l] - 1);
    k++;
    if (k <= h[u] - h[l]) {
        k--;
        for (int z = LOG - 1; z >= 0; z--) {
            if (k & (1 << z)) {
                u = up[z][u];
            }
        }
//        cout << " GET " << u << " " << up_sub[u].first << " " << up_sub[u].second << endl;
        int D = max(dist(up_sub[u].first, v), dist(up_sub[u].second, v));
        return D;
    }
    else {
        k -= (h[u] - h[l]);
        assert(k > 0);
        k = (h[v] - h[l]) - k;
        u = v;
        for (int z = LOG - 1; z >= 0; z--) {
            if (k & (1 << z)) {
                u = up[z][u];
            }
        }
        int D = max(dist(sub[u].first, v), dist(sub[u].second, v));
        return D;
    }
}
void solve() {
    for (int i = 1; i <= n; i++) {
        g[i].clear();
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    dfs(1, -1);
    for (int k = 0; k + 1 < LOG; k++) {
        for (int i = 1; i <= n; i++) {
            up[k + 1][i] = up[k][up[k][i]];
        }
    }
    dfs1(1, -1);
    dfs2(1, -1);
    while (q--) {
        int a, b, k;
        cin >> a >> b >> k;
        if (h[a]%2==h[b]%2)
        {
            if (k%2==1)
            {
                cout << 1 << "\n";
                continue;
            }
            int A = ans(b,a,k/2);
            if (A<k/2)
            {
                cout << -1 << "\n";
            } else cout << 0 << "\n";
        }
        else
        {
            if (k%2==0)
            {
                cout << 0 << "\n";
                continue;
            }
            int A = ans(a,b,k/2+1);
            if (A<k/2)
            {
                cout << 2 << "\n";
            } else cout << 1 << "\n";
        }
    }

}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    while (cin >> n >> q) {
        solve();
    }
    return 0;
}