#include <iostream>
#include <cstdio>
#include <vector>
#define MAXN 100050

using namespace std;

vector<int> graf[MAXN];
int parent[MAXN], n, m, nq;
int val[MAXN], liniar[MAXN], first[MAXN], last[MAXN];
int upx, upy, upval;
struct {int ad, best; } arb[6*MAXN];

void citire()
{
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n-1; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
        graf[x].push_back(y);
        graf[y].push_back(x);
	}
}

void dfs(int nod = 1)
{
	liniar[++nq] = nod;
	first[nod] = nq;
	for (const auto& y : graf[nod])
        if (!parent[y]) {
			parent[y] = nod;
			dfs(y);
			//liniar[++nq] = nod;
        }
	last[nod] = nq;
}

void arbUpdate(int nod, int st, int fn)
{
    if (upx <= st && upy >= fn)
		arb[nod].ad += upval;
	else {
		int mid = (st+fn)>>1;
		if (upx <= mid)
			arbUpdate(nod<<1, st, mid);
		if (upy > mid)
			arbUpdate((nod<<1)+1, mid+1, fn);
	}
    arb[nod].best = arb[nod].ad + std::max(arb[nod<<1].best, arb[(nod<<1)+1].best);
}

int arbQuery(int nod, int st, int dr, int remain, int &rez)
{
    if (st == dr && remain + arb[nod].ad == upval) {
        rez = liniar[st];
        return 1;
    }
    if (st!=dr && remain + arb[nod].ad <= upval && remain + arb[nod].best >= upval)
		if (arbQuery(nod<<1, st, (st+dr)>>1, remain+arb[nod].ad, rez))
			return 1;
		else if (arbQuery((nod<<1)+1, ((st+dr)>>1)+1, dr, remain+arb[nod].ad, rez))
			return 1;
	return 0;
}

void update(int x, int sum)
{
	upx = first[x];
    upy = last[x];
    upval = sum;
    arbUpdate(1, 1, n);
}

int get(int sum)
{
    upval = sum;
    int rez = 0;
    if (arbQuery(1, 1, n, 0, rez))
		return rez;
	return -1;
}

int main()
{
	freopen("arbore.in", "r", stdin);
	freopen("arbore.out", "w", stdout);

    citire();
    parent[1] = 1;
	dfs();
	for (int i = 1; i <= m; i++) {
		int tip, x, y;
        scanf("%d ", &tip);
        if (tip == 1) {
			scanf("%d %d", &x, &y);
            update(x, y);
        }
        else {
			scanf("%d", &x);
            printf("%d\n", get(x));
        }
	}

    return 0;
}