#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>

#define N 100005

using namespace std;

int n,m,c,x,y,f[N],l[N],v[N],vsq;
vector <int> g[N];
vector <int> s,sq,b;
bitset <N> viz,ap[320];

void dfs(int nod = 1){
    f[nod] = s.size();
    viz[nod] = 1;
    s.push_back(nod);
    for(int i : g[nod]){
        if(!viz[i])
            dfs(i);
    }
    l[nod] = s.size()-1;
}

void actualizare(int buc){
    ap[buc].reset();
    for(int i = vsq*buc; i <= (buc+1)*vsq-1; ++i)
        ap[buc][v[i]]=1;
}

void actualizare(int st, int dr, int val){
    if(dr-st+1<vsq){
        for(int i = st; i <= dr; ++i)
            v[i]+=val;
        actualizare(st/vsq);
        return ;
    }
    for(int i = st; i <= dr; ++i){
        if(i%vsq == 0){
            sq[i/vsq] += val;
            i+=vsq-1;
        }
        else
            v[i]+=val;
    }
    if(st%vsq != 0)
        actualizare(st/vsq);
    if(dr%vsq != vsq-1)
        actualizare(dr/vsq);
}

int cauta(int buc, int val){
    for(int i = vsq*buc;i <= (buc+1)*vsq-1; ++i)
        if(v[i]==val)
            return s[i];
    return -1;
}

int cauta(int val){
    for(int i = 0;i<=sq.size();++i)
        if(ap[i][val-sq[i]])
            return cauta(i,val-sq[i]);
    return -1;
}

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

    scanf("%d%d", &n,&m);
    for(int i = 1; i < n; ++i){
        scanf("%d%d", &x,&y);
        g[x].push_back(y);
        g[y].push_back(x);
    }

    dfs();
    vsq = sqrt(s.size());
    sq = vector<int>(s.size()/vsq+1);
    for(int i = 0;i <= s.size()/vsq+1; ++i)
        ap[i][0]=1;

    for(int i=0;i<m;++i){
        scanf("%d%d", &c,&x);
        if(c==1){
            scanf("%d", &y);
            actualizare(f[x],l[x],y);
        }
        else{
            cout<<cauta(x)<<"\n";
        }
    }

    return 0;
}