using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <algorithm>

#define pb push_back
#define sz size
#define f first
#define ss second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair

#define IN  "arbore.in"
#define OUT "arbore.out"
#define N_MAX 1<<17
#define bit(x) (1<<((x) & 31))

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;

VI A[N_MAX];
int Q0,K,N,M,Sqrt = 1;
int P[1<<20],P1[N_MAX],P2[N_MAX],S[1<<18],LSqrt[N_MAX],SSqrt[N_MAX],Q[1<<18];
vector<bool> viz(N_MAX);
int B[1<<9][1<<15];

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d%d",&N,&M);
	
	int x,y;
	FOR(i,1,N-1)
	{
		scanf("%d%d",&x,&y);
		A[x].pb(y);
		A[y].pb(x);
	}
}

II void DF(int nod)
{
	viz[nod] = true;
	bool ok(false);
	
	Q[++Q0] = nod;
	P1[nod] = Q0;
	
	for(VI::iterator it=A[nod].begin();it != A[nod].end();++it)
	{
		if(viz[*it])
			continue;
		DF(*it);
		ok = true;
	}	
	
	if(ok)
		Q[++Q0] = nod;
	P2[nod] = Q0+1;
}

II void update(int p,int s)
{
	int sum;
	int p1 = P1[p] / Sqrt;
	int p2 = P2[p] / Sqrt;
	
	FOR(i,p1+1,p2) SSqrt[i] += s;
	
	sum = LSqrt[p1];
	FOR(i,Sqrt * p1,Sqrt * (p1+1) - 1)
	{
		if(!i)
			continue;
		sum += S[i];
		B[p1][sum >> 5] = 0; 
	}		
	SSqrt[p1] += LSqrt[p1];
	LSqrt[p1] = 0;
	
	S[ P1[p] ] += s;
	
	sum = SSqrt[p1];
	FOR(i,Sqrt * p1,Sqrt * (p1+1) - 1)
	{
		if(!i)
			continue;
		sum += S[i];
		P[sum] = p1;
		B[p1][sum >> 5] |= bit(sum); 
	}	
	LSqrt[p1] = SSqrt[p1];
	SSqrt[p1] = 0;
	
	if(p1 == p2)
	{
		S[ P2[p] ] -= s;
		return;
	}
	
	sum = LSqrt[p2];
	FOR(i,Sqrt * p2,Sqrt * (p2 + 1) - 1)
	{
		if(!i)
			continue;
		sum += S[i];
		B[p2][sum >> 5] = 0; 
	}	
	SSqrt[p2] += LSqrt[p2];
	LSqrt[p2] = 0;
	
	S[ P2[p] ] -= s;
	
	sum = SSqrt[p2];
	FOR(i,Sqrt * p2,Sqrt * (p2 + 1) - 1)
	{
		if(!i)
			continue;
		sum += S[i];
		P[sum] = p2;
		B[p2][sum >> 5] |= bit(sum); 
	}	
	LSqrt[p2] = SSqrt[p2];
	SSqrt[p2] = 0;
}

II int querry(int s)
{
	int p = P[s];
	if( (B[p][(s - SSqrt[p]) >> 5] & bit(s - SSqrt[p])) )
	{
		int sum = 0;
		FOR(i,Sqrt * p,Sqrt * (p + 1) - 1)
		{
			sum += S[i];
			if(i && sum + SSqrt[p] + LSqrt[p] == s)
				return Q[i];
		}	
	}	
	
	FOR(p,0,Q0 / Sqrt)
	{
		if( !(B[p][(s - SSqrt[p]) >> 5] & bit(s - SSqrt[p])) )
			continue;
		
		int sum = 0;
		FOR(i,Sqrt * p,Sqrt * (p + 1) - 1)
		{
			sum += S[i];
			if(i && sum + SSqrt[p] + LSqrt[p] == s)
				return Q[i];
		}	
	}
	return -1;
}

II void solve()
{
	DF(1);
	Q[++Q0] = -1;
	
	for(;Sqrt * Sqrt < Q0;++Sqrt);
	
	FOR(i,0,Q0 / Sqrt)
		B[i][0] |= bit(0);
	
	int tip,p,s;
	FOR(i,1,M)
	{
		scanf("%d",&tip);
		
		if(tip == 1)
		{
			scanf("%d%d",&p,&s);
			update(p,s);
			continue;
		}	
		
		scanf("%d",&s);
		printf("%d\n",querry(s) );
	}
	printf("Time : %d ms\n",clock() );
}

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