#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],GG[NMax];
int N,M,SUM[100005];;

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



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

void Solve1()
{
    int p,s;
    fin>>p>>s;
    SUM[p]+=s;
    for(unsigned int j=0;j<GG[p].size();++j)
    {
        SUM[GG[p][j]]+=s;
    }
}
void Solve2()
{
    int s;
    fin>>s;
    int i=1;
    while(i<=N && SUM[i]!=s)
    {
        ++i;
    }
    if(i==N+1)
    {
        i=-1;
    }
    fout<<i<<"\n";
}

int main()
{
     Read();

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