#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define pb emplace_back
#define sz(a) int(a.size())

const int N = 3e5 + 5;
int n, m;
int siz[N], top[N], hson[N], dep[N], fa[N];
int pot[N];
int dfn[N], ed[N], cntd, seq[N];
vector<int> G[N];
int p;
struct {
  LL tr[N];
  void add(int x, LL y) {
    for (; x <= n; x += x & -x) {
      tr[x] += y;
    }
  }
  LL ask(int x) {
    LL y = 0;
    for (; x; x -= x & -x) {
      y += tr[x];
    }
    return y;
  }
  LL ask(int x, int y) {
    return ask(y) - ask(x - 1);
  }
} A, B;
void add(int x, int y, LL c) {
  A.add(x, c), A.add(y + 1, -c);
  B.add(x, c * x), B.add(y + 1, -c * (y + 1));
}
LL ask(int l, int r) {
  return A.ask(l, r) * (r + 1) - B.ask(l, r) + A.ask(1, l - 1) * (r - l + 1);
}
void dfs1(int u, int F) {
  siz[u] = 1;
  for (auto v : G[u]) {
    if (v != F) {
      dep[v] = dep[u] + 1, fa[v] = u;
      dfs1(v, u), siz[u] += siz[v];
      if (siz[hson[u]] < siz[v]) {
        hson[u] = v;
      }
    }
  }
}
void dfs2(int u, int tp) {
  top[u] = tp, seq[dfn[u] = ++cntd] = u;
  pot[tp] = cntd;
  if (hson[u]) {
    dfs2(hson[u], tp);
  }
  for (auto v : G[u]) {
    if (v != hson[u] && v != fa[u]) {
      dfs2(v, v);
    }
  }
  ed[u] = cntd;
}
int lca(int u, int v) {
  while (top[u] != top[v]) {
    if (dep[top[u]] < dep[top[v]]) {
      swap(u, v);
    }
    u = fa[top[u]];
  }
  return dep[u] < dep[v] ? u : v;
}
int getweight(int u) {
  int L = dfn[u], R = pot[top[u]];
  while (L < R) {
    int mid = ((L + R + 1) >> 1);
    if (siz[seq[mid]] <= siz[u] - siz[seq[mid]]) {
      R = mid - 1;
    }else {
      L = mid;
    }
  }
  return seq[L];
}
void addlink(int x, int y, int z) {
  while (top[x] != top[y]) {
    if (dep[top[x]] < dep[top[y]]) {
      swap(x, y);
    }
    add(dfn[top[x]], dfn[x], z);
    x = fa[top[x]];
  }
  if (dep[x] > dep[y]) {
    swap(x, y);
  }
  add(dfn[x], dfn[y], z);
}
LL sum;
vector<int> to[N], rec;
int qry() {
  int u = 1;
  LL sum = ask(1, n);
  for (; ; ) {
    int L = dfn[top[u]], R = pot[top[u]];
    while (L < R) {
      int mid = ((L + R + 1) >> 1), u = seq[mid];
      LL s = ask(dfn[u], ed[u]);
      if (s <= sum - s) {
        R = mid - 1;
      }else {
        L = mid;
      }
    }
    u = seq[L];
    for (auto v : to[u]) {
      LL s = ask(dfn[v], ed[v]);
      if (s > sum - s) {
        u = v;
        goto End;
      }
    }
    return u;
    End:;
  }
  return u;
}
void ad(int x) {
  while (top[x] != 1) {
    x = top[x];
    to[fa[x]].pb(x);
    x = fa[x];
    rec.pb(x);
  }
}
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v, G[u].pb(v), G[v].pb(u);
  }
  dfs1(1, 0), dfs2(1, 1);
  p = 1;
  while (m--) {
    int op, x, y, z, pos;
    cin >> op;
    ad(p);
    if (op == 1) {
      cin >> x >> z;
      add(dfn[x], ed[x], z);
      ad(getweight(x));
    }else {
      cin >> x >> y >> z;
      addlink(x, y, z), ad(x), ad(y);
    }
    p = qry();
    cout << p << '\n';
    for (auto i : rec) {
      vector<int>().swap(to[i]);
    }
    vector<int>().swap(rec);
  }
  return 0;
}