#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".in").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

const int MX = 1e5+5, BLK = 317;
int N, M, tin[MX], tout[MX], tt, trace[MX], curval[MX], sum[BLK+2];
vi adj[MX];
bitset<1000002> hav[BLK+2];

void dfs(int u, int p) {
    trace[tin[u] = tt++] = u;
    each(v, adj[u]) if(v != p) dfs(v, u);
    tout[u] = tt-1;
}

void solve() {
    cin>>N>>M;
    F0R(i,N-1) {
        int u,v;
        cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    dfs(1, -1);
    F0R(i,N) hav[i/BLK][0] = 1;
    while(M-->0) {
        int t;
        cin>>t;
        if(t == 1) {
            int u, val; cin>>u>>val;
            int L = tin[u]/BLK, R = tout[u]/BLK;
            if(L == R) {
                FOR(i,tin[u], tout[u]+1) hav[L][curval[i]] = 0;
                FOR(i, L*BLK, min(N, (R+1)*BLK)) if(i < tin[u] || i > tout[u]) hav[L][curval[i]] = 1;
                FOR(i,tin[u], tout[u]+1) {
                    curval[i] += val;
                    hav[L][curval[i]] = 1;
                }
            }
            else {
                FOR(i,L+1,R) sum[i] += val;
                FOR(i, tin[u], min(N, (L+1)*BLK)) hav[L][curval[i]] = 0;
                FOR(i, L*BLK, tin[u]) hav[L][curval[i]] = 1;
                FOR(i, tin[u], min(N, (L+1)*BLK)) {
                    curval[i] += val;
                    hav[L][curval[i]] = 1;
                }
                FOR(i, tout[u], min(N, (R+1)*BLK)) hav[R][curval[i]] = 0;
                FOR(i, tout[u]+1, min(N, (R+1)*BLK)) hav[R][curval[i]] = 1;
                FOR(i, R*BLK, tout[u]+1) {
                    curval[i] += val;
                    hav[R][curval[i]] = 1;
                }
            }
        }
        else {
            int val; cin>>val;
            F0R(i,(N-1)/BLK+1) if(sum[i] <= val && hav[i][val-sum[i]]) {
                FOR(j,i*BLK, min(N,(i+1)*BLK)) if(curval[j] + sum[i] == val) {
                    cout << trace[j] << nl;
                    goto done;
                }
            }
            cout << "-1\n";
            done:;
        }
    }
}

int main() {
    setIO("arbore");

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}