#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("arbore.in");
ofstream fout("arbore.out");
const int NMax=100005;
vector <int> G[NMax];
int N,M,SUM[NMax],F[NMax];

 void Read()
 {
     fin>>N>>M;
     for(int i=1;i<=N-1;++i)
     {
         int x,y;
         fin>>x>>y;
         F[y]=x;
         G[x].push_back(y);
         G[y].push_back(x);
     }
     F[1]=0;

 }


 void DFS(int Nod, int Father, int s)
 {
     SUM[Nod]+=s;
     for(unsigned int j=0;j<G[Nod].size();++j)
     {
         int Vecin=G[Nod][j];
         if(Vecin!=Father)
         {
             DFS(Vecin,Nod,s);
         }
     }
 }

void Solve1()
{
    int p,s;
    fin>>p>>s;
    DFS(p,F[p],s);
}
void Solve2()
{
    int s;
    fin>>s;
    int i=1;
    while(SUM[i]!=s && i<=N)
    {
        ++i;
    }
    if(i<=N)
    fout<<i<<"\n";
    else
        fout<<"-1"<<"\n";
}

int main()
{
     Read();
    for(int i=1;i<=M;++i)
     {
         int x;
         fin>>x;
        if(x==1)
        {
            Solve1();
        }
        else
        {
            Solve2();
        }
     }
    return 0;
}