#include <bits/stdc++.h>

using namespace std;

#define BSIZE 512
#define MAXN 100005
int Block[MAXN], Start[MAXN], End[MAXN], Val[MAXN], B[MAXN], E[MAXN], Sum[MAXN], Sort[MAXN];
bool Updated[MAXN];

vector<int> G[MAXN];

int timer = 0, blocks;

void dfs(int node) {
    B[node] = ++timer;
    for(auto vec : G[node])
        if(!B[vec])
            dfs(vec);
    E[node] = timer;
}

void Update(int l, int r, int delta) {
    while(l <= r) {
        int b = Block[l];

        if(l == Start[b] && End[b] <= r) {
            Sum[b] += delta;
            l = End[b] + 1;
        } else {
            Val[l] += delta;
            Updated[b] = 0;
            l += 1;
        }
    }
}

void Init(int n) {
    for(int i=1; i<=n; i++) {
        Block[i] = i / BSIZE;
        End[Block[i]] = i;
        if(Start[Block[i]] == 0)
            Start[Block[i]] = i;
        Sort[i] = i;
    }
    blocks = Block[n] + 1;
}

auto cmp = [](int a, int b) {
    return Val[a] < Val[b];
};

void Refresh(int b) {
    sort(Sort + Start[b], Sort + End[b] + 1, cmp);
    Updated[b] = 1;
}

void Op1(int n, int s) {
    Update(B[n], E[n], s);
}
int Op2(int s) {
    for(int b = 0; b < blocks; b ++) {
        if(!Updated[b])
            Refresh(b);

        Val[0] = s - Sum[b];
        int ind = lower_bound(Sort + Start[b], Sort + End[b] + 1, 0, cmp) - Sort;
        if(ind <= End[b] && Val[0] == Val[Sort[ind]])
            return Sort[ind];
    }

    return -1;
}

int main() {
    freopen("arbore.in", "r", stdin);
    freopen("arbore.out", "w", stdout);

    int n, m, a, b, t, s;
    cin >> n >> m;

    for(int i=1; i<n; i++) {
        cin >> a >> b;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    Init(n);
    dfs(1);

    while(m--) {
        cin >> t;
        if(t == 2) {
            cin >> s;
            cout << Op2(s) << '\n';
        } else {
            cin >> a >> s;
            Op1(a, s);
        }
    }

    return 0;
}