#include <fstream>
#include <vector>
#include <bitset>

using namespace std;
ifstream f("arbore.in");
ofstream g("arbore.out");

const int Nmax = 100005, Mmax = 320;
int n, m, opt, arb[Nmax], arbl[Nmax], arbr[Nmax], k, nlist, listr[Mmax], listl[Mmax], listv[Mmax], v[Nmax];
bool Use[Nmax];
bitset <Nmax*10> H[Mmax];
vector <int> G[Nmax];

void Read()
{
    f>>n>>m;
    for(int i = 1; i < n; i++)
    {
        int x, y;
        f>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
}

void DFS(int nod)
{
    Use[nod] = 1;
    arb[++k] = nod;
    arbl[nod] = k;
    for(int i = 0; i < (int)G[nod].size(); i++)
    {
        int vecin = G[nod][i];
        if(!Use[vecin]) DFS(vecin);
    }
    arbr[nod] = k;
}

void Lists()
{
    for(nlist = 1; nlist*nlist <= n; nlist++);
    nlist--;
    int listi = 0;
    for(int i = 1; i <= n; listi++)
    {
        H[listi][0] = 1;
        listl[listi] = i;
        listr[listi] = i+nlist-1;
        i += nlist;
    }
    nlist = listi;
    listr[nlist-1] = n;
}

void Solve1(int &ul, int &ur, int &uv)
{
    for(int i = 0; i < nlist; i++)
    {
        if(listl[i] > ur || listr[i] < ul)
            continue;
        if(ul <= listl[i] && listr[i] <= ur)
        {
            listv[i] += uv;
            continue;
        }
        for(int j = listl[i]; j <= listr[i]; j++)
        {
            H[i][v[j]] = 0;
            v[j] += (listv[i]+uv*(ul<=j && j <= ur));
        }
        listv[i] = 0;
        for(int j = listl[i]; j <= listr[i]; j++)
        {
            H[i][v[j]] = 1;
        }
    }
}

int Solve2(int &x)
{
    for(int i =0; i < nlist; i++)
    {
        if(x < listv[i]) continue;
        if(H[i][x-listv[i]])
        {
            x -= listv[i];
            for(int j = listl[i]; j <= listr[i]; j++)
            {
                if(v[j] == x)
                    return arb[j];
            }
        }
    }
    return -1;
}

int main()
{
    Read();
    DFS(1);
    Lists();
    while(m--)
    {
        f>>opt;
        if(opt == 1)
        {
            int x,y;
            f>>x>>y;
            Solve1(arbl[x], arbr[x], y);
        }
        else
        {
            int x;
            f>>x;
            g<<Solve2(x)<<'\n';
        }
    }
    return 0;
}