#include<fstream>
#include<vector>
#include<cmath>
#include<bitset>
#include<algorithm>
using namespace std;
ofstream g("arbore.out");
class InputReader {
  private:
    static const int BUFF_SIZE = 100000;
    FILE *f;
    int bp;
    char buff[BUFF_SIZE];
    inline void nxt() {
      if (++bp == BUFF_SIZE) {
        fread(buff, sizeof(char), BUFF_SIZE, f);
        bp = 0;
      }
    }
  public:
    InputReader (const char *file_name) {
      f = fopen(file_name, "r");
      bp = BUFF_SIZE - 1;
    }
    void close() {
      fclose(f);
    }
    InputReader& operator >> (int &num) {
      num = 0;
      while (isdigit(buff[bp]) == 0&&buff[bp]!='-')
        nxt();
      int semn=1;
      if(buff[bp]=='-')
      {
        semn=-1;
        nxt();
      }
      while (isdigit(buff[bp])) {
        num = num * 10 + (buff[bp] - '0')*semn;
        nxt();
      }
      return *this;
    }
} f("arbore.in");
vector<int>a[100002];
int v[100002],dim[100002],k,poz[100002],r,s[100002],w[100002],n;
bitset<1000002>fv[320];
inline void dfs(int x,int tata)
{
    int i,l=a[x].size();
    v[++k]=x;
    poz[x]=k;
    dim[x]=1;
    for(i=0;i<l;i++)
    if(a[x][i]!=tata)
    {
        dfs(a[x][i],x);
        dim[x]+=dim[a[x][i]];
    }
}

inline void update(int x,int y)
{
    int xx=x;
    x=poz[x];
    int i,st=(x-1)/r+1,dr=(x+dim[xx]-1-1)/r+1;
    for(i=st+1;i<=dr-1;i++)
        s[i]+=y;
    if(st==dr)
    {
        for(i=(st-1)*r+1;i<=min(n,st*r);i++)
            fv[st][w[v[i]]]=0;
        for(i=x;i<=x+dim[xx]-1;i++)
            w[v[i]]+=y;
        for(i=(st-1)*r+1;i<=min(n,st*r);i++)
            fv[st][w[v[i]]]=1;
    }
    else
    {
        for(i=(st-1)*r+1;i<=st*r;i++)
            fv[st][w[v[i]]]=0;
        for(i=x;i<=st*r;i++)
            w[v[i]]+=y;
        for(i=(st-1)*r+1;i<=st*r;i++)
            fv[st][w[v[i]]]=1;
        for(i=(dr-1)*r+1;i<=min(n,dr*r);i++)
            fv[dr][w[v[i]]]=0;
        for(i=(dr-1)*r+1;i<=x+dim[xx]-1;i++)
            w[v[i]]+=y;
        for(i=(dr-1)*r+1;i<=min(n,dr*r);i++)
            fv[dr][w[v[i]]]=1;
    }
}

inline int query(int x)
{
    int i,j;
    for(i=1;i<=n/r;i++)
    if(x>=s[i]&&fv[i][x-s[i]]!=0)
    {
        for(j=(i-1)*r+1;j<=i*r;j++)
        if(w[v[j]]+s[i]==x)
            return v[j];
    }
    for(i=n-n%r+1;i<=n;i++)
    if(w[v[i]]==x)
        return v[i];
    return -1;
}

int main()
{
    int m,x,y,p,i;
    f>>n>>m;
    for(i=1;i<n;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    dfs(1,0);
    r=sqrtl(n);
    for(i=1;i<=n/r;i++)
        fv[i][0]=1;
    for(i=1;i<=m;i++)
    {
        f>>p;
        if(p==1)
        {
            f>>x>>y;
            update(x,y);
        }
        else
        {
            f>>x;
            g<<query(x)<<'\n';
        }
    }
    return 0;
}