#include<fstream>
#include<vector>
#include<set>

#define VAL val[line[i]]
#define NMAX 100005
#define MOD 1000

using namespace std;

ifstream fin("arbore.in");
ofstream fout("arbore.out");

int n,m;
vector<int> G[NMAX],line;
set<int> sums[MOD][MOD];
int val[NMAX],first[NMAX],last[NMAX];

//
const int SZ=10000;
char input[SZ+1],*in;
 
int atoi()
{
    int nr =0;
    for(;!(*in>='0' && *in<='9') && *in;in++);
 
    if(!*in)
    {
        fin.read(input,SZ);
        in=input;
        for(;!(*in>='0' && *in<='9') && *in;in++);
    }
    for(;*in>='0' && *in<='9';in++)
    {
        nr=nr*10+(*in-'0');
        if(!*(in+1))
        {
            fin.read(input,SZ);
            in=input-1;
        }
    }
    return nr;
}
//

void read()
{
	fin.read(input,SZ);
	in=input;
	n=atoi();
	m=atoi();
	for(int i=1,x,y;i<n;i++)
	{
		x=atoi();
		y=atoi();
		G[x].push_back(y);
		G[y].push_back(x);
	}
}

void DFS(int nod,int tt)
{
	line.push_back(nod);
	first[nod]=line.size()-1;
	for(size_t i=0;i<G[nod].size();i++)
		if(G[nod][i]!=tt)
			DFS(G[nod][i],nod);
	last[nod]=line.size()-1;
}

void solve()
{
	DFS(1,0);
	for(int choice,x,y;m;m--)
	{
		choice=atoi();
		x=atoi();
		if(choice==1)
		{
			y=atoi();
			for(int i=first[x];i<=last[x];i++)
			{
				sums[VAL%MOD] [VAL%MOD].erase(line[i]);
				VAL+=y;
				sums[VAL%MOD] [VAL%MOD].insert(line[i]);
			}
			continue;
		}
		if(sums[x%MOD][x%MOD].empty())
			fout<<"-1\n";
		else
			fout<<*(sums[x%MOD][x%MOD].begin())<<'\n';
	}
}

int main()
{
	read();
	solve();
	return 0;
}