# include <algorithm>
# include <cassert>
# include <cstdio>
# include <cmath>
# include <vector>
using namespace std;

const char *FIN = "arbore.in", *FOU = "arbore.out";
const int MAX = 100005;

bool viz[MAX];
int N, M, vec[MAX], ST[MAX], DR[MAX], ai[MAX << 2], cnt[MAX << 2];
vector<int> G[MAX];

void dfs (int node) {
    vec[++vec[0]] = node, ST[node] = vec[0];
    viz[node] = 1;
    for (vector <int> :: iterator it = G[node].begin (); it != G[node].end (); ++it)
        if (viz[*it] == 0)
            dfs (*it);
    DR[node] = vec[0];
}

void update (int node, int st, int dr, int l, int val) {
    if (ST[l] <= st && dr <= DR[l]) {
        cnt[node] += val;
    } else {
        int mij = (st + dr) >> 1;
        if (ST[l] <= mij) update (node << 1, st, mij, l, val);
        if (mij < DR[l]) update ((node << 1) | 1, mij + 1, dr, l, val);
    }
    ai[node] = cnt[node] + max (ai[node << 1], ai[(node << 1) | 1]);
}

int query (int node, int st, int dr, int l) {
    if ((l -= cnt[node]) == 0) {
        printf ("%d\n", vec[st]);
        return 1;
    }
    int value = 0;
    if (st != dr && l > 0 && ai[node] - cnt[node] >= l) {
        int mij = (st + dr) >> 1;
        if ((value = query (node << 1, st, mij, l)) == 0)
            value = query ((node << 1) | 1, mij + 1, dr, l);
    }
    l += cnt[node];
    return value;
}

int main (void) {
    assert (freopen (FIN, "r", stdin));
    assert (freopen (FOU, "w", stdout));

    assert (scanf ("%d %d", &N, &M) == 2);
    for (int i = 1, x, y; i < N; ++i) {
        assert (scanf ("%d %d", &x, &y) == 2);
        G[x].push_back (y);
        G[y].push_back (x);
    }
    dfs (1);

    for (int what, p, s; M; --M) {
        assert (scanf ("%d %d", &what, &p) == 2);
        if (what == 1) {
            assert (scanf ("%d", &s) == 1);
            update (1, 1, N, p, s);
        } else {
            if (query (1, 1, N, p) == 0)
                printf ("-1\n");
        }
    }
}