#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
const string problemName = "arbore";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int NMAX = (1e5) + 5;
const int VMAX = (1e6) + 5;

int N, M;
int K, L; // K e numarul de bucati, L e lungimea bucatii
int Z[NMAX], top; // "linearizarea" arborelui cu radacina in 1
int lo[NMAX]; // inceputul subarborelui lui i in "linearizare"
int hi[NMAX]; // sfarsitul subarborelui lui i in "linearizare"
bitset<NMAX> viz;
vector<int> V[NMAX];
int A[2 * NMAX]; // valoarea in nodul x (fara ce se afla in C[bckt[x]]
int C[333]; // valoarea care se aduna la toate elementele din bucata x
bool P[333][2 * VMAX]; // daca suma s-C[x] se afla in bucket-ul i

void dfs(int x) {
    Z[++top] = x;
    lo[x] = hi[x] = top;
    viz[x] = 1;

    for(auto y : V[x])
        if(!viz[y]) {
            dfs(y);
            hi[x] = max(hi[x], hi[y]);
        }
}

/* inceputul bucket-ului x */
inline int lo_bckt(int x) {
    return (x - 1) * L + 1;
}

/* sfarsitul bucket-ului x */
inline int hi_bckt(int x) {
    return x * L;
}

/* numarul bucket-ului care il contine pe x */
inline int bckt(int x) {
    return (x - 1) / L + 1;
}

/* adaug s la toate elementele dintre lo si hi */
void update(int lo, int hi, int s) {
    int a = bckt(lo);
    int b = bckt(hi);
    int i;

    if(a == b) {
        for(i = lo_bckt(a); i <= hi_bckt(a); i++)
            P[a][A[i]] = 0;
        for(i = lo_bckt(a); i <= hi_bckt(a); i++)
            A[i] += C[a] + (lo <= i && i <= hi) * s;
        for(i = lo_bckt(a); i <= hi_bckt(a); i++)
            P[a][A[i]] = 1;

        C[a] = 0;
    } else {
        for(i = a + 1; i <= b - 1; i++)
            C[i] += s;

        for(i = lo_bckt(a); i <= hi_bckt(a); i++)
            P[a][A[i]] = 0;
        for(i = lo_bckt(a); i <= hi_bckt(a); i++)
            A[i] += C[a] + (lo <= i && i <= hi) * s;
        for(i = lo_bckt(a); i <= hi_bckt(a); i++)
            P[a][A[i]] = 1;

        for(i = lo_bckt(b); i <= hi_bckt(b); i++)
            P[b][A[i]] = 0;
        for(i = lo_bckt(b); i <= hi_bckt(b); i++)
            A[i] += C[b] + (lo <= i && i <= hi) * s;
        for(i = lo_bckt(b); i <= hi_bckt(b); i++)
            P[b][A[i]] = 1;

        C[a] = C[b] = 0;
    }
}

/* verific daca am suma s pe undeva */
int query(int s) {
    int i, j;

    for(i = 1; i <= K; i++)
        if(s - C[i] >= 0 && P[i][s - C[i]])
            for(j = lo_bckt(i); j <= hi_bckt(i); j++)
                if(A[j] + C[i] == s && j <= N)
                    return Z[j];

    return -1;
}

int main() {
    int i, x, y, q, s;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    for(i = 1; i <= N - 1; i++) {
        scanf("%d%d", &x, &y);
        V[x].push_back(y);
        V[y].push_back(x);
    }

    dfs(1);

    for(K = 1; K * K <= N; K++)
        P[K][0] = 1;
    K--;
    L = N / K + (N % K != 0);

    while(M--) {
        scanf("%d", &q);
        if(q == 1) {
            scanf("%d%d", &x, &s);
            update(lo[x], hi[x], s);
        } else {
            scanf("%d", &s);
            printf("%d\n", query(s));
        }
    }

    return 0;
}