#include<cstdio>
#include<vector>
#include<bitset>
using namespace std;
vector<int>L[100100];
bitset<1001000>D[350];
int n,m,k,i,j,op,a,b,c,d,nr,p,u,v[100100],y[100100],l[100100],r[100100],z[100100],x[100100];
FILE *f,*g;
int maxim(int a,int b){
    if(a>b)
        return a;
    return b;
}
int minim(int a,int b){
    if(a<b)
        return a;
    return b;
}
void dfs(int nod){
    v[nod]=1;
    y[++nr]=nod;
    l[nod]=nr;
    for(int i=0;i<L[nod].size();i++){
        if( v[ L[nod][i] ] == 0 )
            dfs( L[nod][i] );
    }
    r[nod]=nr;
}
void upd(int nod,int s){
    a=l[nod];
    b=r[nod];
    c=(a-1)/k+1;
    d=(b-1)/k+1;
    for(i=c;i<=d;i++){
        if( ( i - 1 ) * k + 1 >= a && i * k <= b ){
            z[i]+=s;
        }
        else if( i * k >= a || ( i - 1 ) * k + 1 <= b ){
            p=(i-1)*k+1;
            u=i*k;
            p=maxim(p,a);
            u=minim(u,b);
            for( j = (i-1) * k + 1; j <= i * k ; j++ ){
                D[i][ x[j] ]=1;
            }
            for( j = (i-1) * k + 1; j <= i * k ; j++ ){
                x[j] += z[i];
                if( j >= a && j <= b )
                    x[j] += s;
                D[i][ x[j] ]=1;
            }
            z[i]=0;
        }
    }
}
int query(int s){
    for( i = 1 ; i <= (n-1) / k + 1 ; i++ ){
        if( s - z[i] >= 0 && D[i][ s-z[i] ] == 1 ){
            for( j = (i-1) * k + 1 ; j <= i * k ; j++ ){
                if( x[j] + z[i] == s )
                    return y[j];
            }
        }
    }
    return -1;
}
int main(){
    f=fopen("arbore.in","r");
    g=fopen("arbore.out","w");
    fscanf(f,"%d%d",&n,&m);
    for(k=1;k*k<=n;k++){
        D[k][0]=1;
    }
    k--;
    for(i=1;i<n;i++){
        fscanf(f,"%d%d",&a,&b);
        L[a].push_back(b);
        L[b].push_back(a);
    }
    dfs(1);
    while(m--){
        fscanf(f,"%d",&op);
        if(op==1){
            fscanf(f,"%d%d",&a,&b);
            upd(a,b);
        }
        else{
            fscanf(f,"%d",&a);
            fprintf(g,"%d\n",query(a));
        }
    }

    fclose(f);
    fclose(g);
    return 0;
}