#include <bits/stdc++.h>

using namespace std;

ifstream f("arbore.in");
ofstream g("arbore.out");

const int NMAX = 100005;
vector <int> v[NMAX];
int n,m,father[NMAX],val[NMAX];
bool ok;

void dfs(int nod){
    for(auto it: v[nod])
        if(it != father[nod]){
            father[it] = nod;
            dfs(it);
        }
}

void DFS(int nod, int value){
    val[nod] += value;
    for(auto it: v[nod])
        if(father[nod] != it){
            DFS(it,value);
        }
}

int main(){
    int i,j,x,y,type;
    f >> n >> m;
    for(i = 1 ; i < n; i++){
        f >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(1);

    for(i = 1 ; i <= m ; i++){
        f >> type;
        if(type == 1){
            f >> x >> y;
            DFS(x,y);
        }else{
            ok = 0;
            f >> x;
            for(j = 1 ; j <= n ; j++)
                if(val[j] == x){
                    g << j << "\n";
                    j = n + 4;
                }

            if(j == n + 1)
                g << -1 << "\n";
        }
    }

    return 0;
}