#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>
#define Nmax 100005
using namespace std;
vector<int> V[Nmax];
vector<int> G[Nmax];
vector<int> ::iterator it;
queue <int> C;
int ar[Nmax],suma[Nmax];
int n,m,i,op,p,s;
int S[1000000];
bool viz[Nmax];
void reading(int &n,int &m)
{
      int k,x,y;
     freopen("arbore.in","r",stdin);
     freopen("arbore.out","w",stdout);
     scanf("%d %d",&n,&m);
     for(k=1;k<=n-1;++k)
     {
        scanf("%d %d",&x,&y);
        G[x].push_back(y);
        G[y].push_back(x);
     }
}
void init()
{
    int k;
    for(k=1;k<=1000000;++k)
    {
        S[k]=0;
        if (k<Nmax) {viz[k]=0;suma[k]=0;}
    }
}
void make_tree()
{
    int x;
    ar[1]=0;
    C.push(1);viz[1]=1;
    while(!C.empty())
    {
        x=C.front();C.pop();
        for(it=G[x].begin();it!=G[x].end();++it)
          if (!viz[*it])
          {
              ar[*it]=x;
              C.push(*it);
              viz[*it]=1;
          }
    }
}
void boss(int nod)
{
    int aux=nod;
    V[nod].push_back(nod);
   while(ar[nod]!=0)
   {
      nod=ar[nod];
      V[nod].push_back(aux);
   }
}
int main()
{
    reading(n,m);
    init();
    make_tree();
    for(i=1;i<=n;++i) boss(i);
    for(i=1;i<=m;++i)
    {
        scanf("%d",&op);
        if (op==1)
        {

            scanf("%d %d",&p,&s);
            for(it=V[p].begin();it!=V[p].end();++it)
               {
                   suma[*it]=suma[*it]+s;
                   //if (S[suma[*it]]==0) S[suma[*it]]=*it;
               }
        }
        else
        {
           scanf("%d",&s);
           for(int j=1;j<=n;++j)
            if (suma[j]==s)
            {
                printf("%d\n",j);
                break;
            }
        }
    }
    return 0;
}