#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;

int i,j,n,m,x,y,tip,p,s,sum[100001],s1[1000001],viz[1000001],cr[100001];
vector<int> a[100001];
void init()
{
	for(int i=1;i<=n;++i)
		viz[i]=0;
}
void det(int x,int suma)
{
	int i;
	viz[x]=1;
	if(cr[sum[x]]==1)
	s1[sum[x]]=0;
	else
		--cr[sum[x]];
	sum[x]+=suma;
	for(i=0;i<a[x].size();++i)
		if(!viz[a[x][i]])
			det(a[x][i],suma);
		s1[sum[x]]=x;
		++cr[sum[x]];
}
int main()
{
	ifstream f("arbore.in");
	ofstream g("arbore.out");
	f>>n>>m;
	for(i=1;i<n;++i)
	{
		f>>x>>y;
		a[x].push_back(y);
	}
	for(i=1;i<=m;++i)
	{
		f>>tip;
		init();
		if(tip==1)
		{
			f>>p>>s;
			det(p,s);
		}
		else
		{
			f>>s;
			if(s1[s])
			g<<s1[s]<<"\n";
			else
				g<<"-1"<<"\n";
		}
	}
	return 0;
}