#include <bits/stdc++.h>

using namespace std;
ifstream in("arbore.in");
ofstream out("arbore.out");
const int N = 2e5+5;
const int R = 335;
vector<int> v[N];
int a[N],c[R],n,m;
bool p[R][1000005],viz[N];
int st[N],sf[N],el[N],ind;
void dfs(int x)
{
    viz[x] = 1;
    st[x] = ++ind;
    el[ind] = x;
    for (auto it: v[x])
        if (!viz[it])
            dfs(it);
    sf[x] = ind;
}
int block(int k)
{
    int poz = k/R;
    if (k%R != 0)
        poz++;
    return poz;
}
void update(int l, int r, int val)
{
    int beg = block(l);

    for (int i = (beg-1)*R+1; i<=beg*R; i++)
        p[beg][a[i]] = 0;
    for (int i = l; i<=r && i<=beg*R; i++)
        a[i]+=val;
    for (int i = (beg-1)*R+1; i<=beg*R; i++)
        p[beg][a[i]] = 1;

    if (beg == block(r))
        return;
    beg++;
    while (beg<block(r))
        c[beg++]+=val;

    for (int i = (beg-1)*R+1; i<=beg*R; i++)
        p[beg][a[i]] = 0;
    for (int i = (beg-1)*R+1; i<=r; i++)
        a[i]+=val;
    for (int i = (beg-1)*R+1; i<=beg*R; i++)
        p[beg][a[i]] = 1;

}
int query(int val)
{
    for (int i = 1; i<block(n); i++)
        if (val>=c[i] && p[i][val-c[i]])
        {
            for (int j = (i-1)*R+1; j<=i*R; j++)
                if (a[j] == val-c[i])
                    return el[j];
        }
    for (int i = (block(n)-1)*R+1; i<=n; i++)
        if (a[i] == val-c[block(n)])
            return el[i];
    return -1;
}
int main()
{
    in >> n >> m;
    for (int i = 1; i<n; i++)
    {
        int x,y;
        in >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(1);
    for (int i = 1; i<=m; i++)
    {
        int t;
        in >> t;
        if (t == 1)
        {
            int k,val;
            in >> k >> val;
            update(st[k],sf[k],val);
        }
        else
        {
            int val;
            in >> val;
            out << query(val) << "\n";
        }
    }
}