#include<bits/stdc++.h>
#define K 310
using namespace std;
int nr,n,m,x,y,tip,st[400],dr[400],buc[400],fin[400],poz[400],viz[100004],a[100004],v[100004];
vector<int> mch[100004];
bitset<350> ap[400];

void dfs(int nod)
{
    viz[nod] = 1;
    a[++nr] = nod;
    poz[nod] = nr;
    for(int i = 0; i < mch[nod].size(); i ++)
        if(viz[mch[nod][i]] == 0)
            dfs(mch[nod][i]);
    fin[nod] = nr;
}
void updbit(int buc, int val)
{
    for(int i = st[buc]; i <= dr[buc]; i++)
        ap[buc][v[i]] = val;
}
void update(int x, int y, int val)
{
    int buc1 = x / K + 1;
    int buc2 = y / K + 1;
    if(buc1 != buc2)
    {
        updbit(buc1,0);
        updbit(buc2,0);
        for(int i = x; i <= dr[buc1]; i ++)
            v[i] += val;
        for(int i = st[buc2]; i <= y; i ++)
            v[i] += val;
        updbit(buc1,1);
        updbit(buc2,1);
        for(int i = buc1 + 1; i <= buc2 - 1; i ++)
            buc[i] += val;
    }
    else
    {
        updbit(buc2,0);
        for(int i = x; i <= y; i ++)
            v[i] += val;
        updbit(buc1,1);
    }
}
int query(int x)
{
    for(int i = 1; i <= nr; i++)
        if(x - buc[i] >= 0 && ap[i][x-buc[i]] )
        {
            for(int j = st[i]; j <= dr[i]; j++)
                if(v[j] == x - buc[i]) return a[j];
        }
    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-1; i++)
    {
        scanf("%d %d",&x, &y);
        mch[x].push_back(y);
        mch[y].push_back(x);
    }
    dfs(1);
    nr = n/K;
    st[1] = 1;
    dr[1] = K - 1;
    for(int i = 2; i <= nr; i ++)
    {
        st[i] = st[i-1] + K;
        dr[i] = dr[i-1] + K;
    }
    if(dr[nr] < n)
    {
        nr++;
        st[nr] = dr[nr-1] + 1;
        dr[nr] = n;
    }
    for(int i = 1; i <= m; i ++)
    {
        scanf("%d",&tip);
        if(tip == 1) /// Update
        {
            scanf("%d %d",&x, &y);
            update(poz[x], fin[x], y);
        }
        else  /// Query
        {
            scanf("%d",&x);
            printf("%d\n", query(x));
        }
    }
    return 0;
}