#include <fstream>
#include <algorithm>
#include <vector>
#include <cassert>
#include <cmath>
#include <stack>
#include <set>
#include <functional>
#include <bitset>
#include <map>
#include <unordered_map>
#include <queue>
#include <array>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename A> ostream& operator<<(ostream &os, vector<A>&a) { for(auto &c:a)os<<c<<' '; return os;}
template<typename A> istream& operator>>(istream  &os, vector<A>&a) { for(auto &c:a)os>>c; return os;}
template<typename A,size_t N> istream& operator>>(istream &os, array<A,N>&a) { for(auto &c:a)os>>c; return os;}
template<typename A,typename B> istream& operator>>(istream  &os, pair<A,B>&a) { os>>a.first>>a.second; return os;}
#define bug(a) cerr << "(" << #a << ": " << a << ")\n";
#define all(x) x.begin(),x.end()
#define pb push_back
#define PQ priority_queue
#define pii pair<int,int>
using i64= int64_t;
using i16= int16_t;
using u64= uint64_t;
using u32= uint32_t;
using i32= int32_t;
using u16= uint16_t;
const int N=1e6;
const i32 inf=1e9;
const i64 INF=1e18;
const int mod=1e9+7;
ifstream cin("arbore.in");
ofstream cout("arbore.out");
void solve()
{
    int n,q;
    cin>>n>>q;
    vector<vector<int>>g(n);
    for(int i=1;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        x--;
        y--;
        g[x].pb(y);
        g[y].pb(x);
    }
    int sq=int(sqrt(n));
    vector<pii>poz(n);
    function<void(int,int,int&)>dfs=[&](int nod,int tt,int& acm)
    {
        poz[nod].first=++acm;
        for(auto& c :g[nod])
        {
            if(c!=tt)
                dfs(c,nod,acm);
        }
        poz[nod].second=acm;
    };
    {int z=-1;dfs(0,0,z);}



    int m=(n-1)/sq+1;
    vector<bitset<N+1>>c(m);
    vector<int>add(m,0),val(n,0);
    for(auto &v:c)v.flip(0);



    auto set_up=[&](int bucket,bool valoare)
    {
        for(int i=bucket*sq;i<min(bucket*sq+sq,n);i++)
        {
            c[bucket][val[i]]=valoare;
        }
    };
    auto update=[&](int l,int r,int valoare)
    {
        if(l/sq==r/sq)
        {
            set_up(l/sq,0);
            for(int i=l;i<=r;i++)
            {
                val[i]+=valoare;
            }
            set_up(l/sq,1);
            return;
        }

        set_up(l/sq,0);
        for(int i=l;i<(l/sq+1)*sq;i++)
        {
            val[i]+=valoare;
        }
        set_up(l/sq,1);

        for(int i=l/sq+1;i<r/sq;i++)
        {
            add[i]+=valoare;
        }

        set_up(r/sq,0);
        for(int i=r/sq*sq;i<=r;i++)
        {
            val[i]+=valoare;
        }
        set_up(r/sq,1);
    };
    auto query=[&](int s)->int
    {
        for(int i=0;i<m;i++)
        {
            if(s-add[i]>=0 && c[i][s-add[i]])
            {
                for(int j=i*sq;;j++)
                {
                    if(val[j]==s-add[i])
                    {
                        return j+1;
                    }
                }
            }
        }
        return -1;
    };
    while(q--)
    {
        int cer;
        cin>>cer;
        if(cer==1)
        {
            int nod,val;
            cin>>nod>>val;
            nod--;
            update(poz[nod].first,poz[nod].second,val);
        }
        else
        {
            int s;
            cin>>s;
            cout<<query(s)<<'\n';
        }
    }
}
main()
{
    auto sol=[&](bool x)
    {
        if(x)return "YES\n";
        return "NO\n";
    };
    i32 tt=1;
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cin>>tt;
    while(tt--)
    {
        solve();
    }
}