#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void rd(T &x) {
  char ch;
  x = 0;
  bool fl = false;
  while (!isdigit(ch = getchar())) (ch == '-') && (fl = true);
  for (x = (ch ^ '0'); isdigit(ch = getchar()); x = x * 10 + (ch ^ '0'))
    ;
  (fl == true) && (x = -x);
}
template <class T>
inline void output(T x) {
  if (x / 10) output(x / 10);
  putchar(x % 10 + '0');
}
template <class T>
inline void ot(T x) {
  if (x < 0) putchar('-'), x = -x;
  output(x);
  putchar(' ');
}
template <class T>
inline void prt(T a[], int st, int nd) {
  for (register int i = st; i <= nd; ++i) ot(a[i]);
  putchar('\n');
}
namespace Miracle {
const int N = 200000 + 5;
int n, m;
int lim;
struct edge {
  int nxt, to;
} e[2 * N];
int hd[N], cnt;
priority_queue<int, vector<int>, greater<int> > q;
void link(int x, int y) {
  e[++cnt].nxt = hd[x];
  e[cnt].to = y;
  hd[x] = cnt;
}
int f[2 * N];
void add(int x, int c) {
  for (; x <= lim; x += x & (-x)) f[x] += c;
}
int query(int x) {
  int ret = 0;
  for (; x; x -= x & (-x)) ret += f[x];
  return ret;
}
struct node {
  int ch[2], fa;
  int rev, tim;
  int tag;
  int sz;
  void op() {
    cout << " ch[0] " << ch[0] << " ch[1] " << ch[1] << " fa " << fa << endl;
  }
} t[N];
int du[N];
void dfs(int x, int fa) {
  t[x].sz = 1;
  for (register int i = hd[x]; i; i = e[i].nxt) {
    int y = e[i].to;
    if (y == fa) continue;
    t[y].fa = x;
    dfs(y, x);
  }
}
bool nrt(int x) { return (t[t[x].fa].ch[0] == x || t[t[x].fa].ch[1] == x); }
void pushup(int x) {
  if (x) t[x].sz = t[t[x].ch[0]].sz + t[t[x].ch[1]].sz + 1;
}
void tag(int x, int c) {
  t[x].tag = c;
  t[x].tim = c;
}
void rev(int x) {
  t[x].rev ^= 1;
  swap(t[x].ch[0], t[x].ch[1]);
}
void pushdown(int x) {
  if (t[x].rev) {
    rev(t[x].ch[0]);
    rev(t[x].ch[1]);
    t[x].rev = 0;
  }
  if (t[x].tag) {
    tag(t[x].ch[0], t[x].tag);
    tag(t[x].ch[1], t[x].tag);
    t[x].tag = 0;
  }
}
void rotate(int x) {
  int y = t[x].fa, d = t[y].ch[1] == x;
  t[t[y].ch[d] = t[x].ch[!d]].fa = y;
  if (nrt(y))
    t[t[x].fa = t[y].fa].ch[t[t[y].fa].ch[1] == y] = x;
  else
    t[x].fa = t[y].fa;
  t[t[x].ch[!d] = y].fa = x;
  pushup(y);
}
int sta[N];
void splay(int x) {
  int y = x, z = 0;
  sta[++z] = y;
  while (nrt(y)) y = t[y].fa, sta[++z] = y;
  while (z) pushdown(sta[z--]);
  while (nrt(x)) {
    y = t[x].fa, z = t[y].fa;
    if (nrt(y)) {
      rotate((t[y].ch[0] == x) == (t[z].ch[0] == y) ? y : x);
    }
    rotate(x);
  }
  pushup(x);
}
void access(int x, int c) {
  for (register int y = 0; x; y = x, x = t[x].fa) {
    splay(x);
    add(t[x].tim, -t[t[x].ch[0]].sz - 1);
    add(c, t[t[x].ch[0]].sz + 1);
    t[x].ch[1] = y;
    tag(x, c);
    pushup(x);
  }
}
void makert(int x, int c) {
  access(x, c);
  splay(x);
  rev(x);
}
int rk(int x) {
  splay(x);
  int ret = t[t[x].ch[1]].sz + query(t[x].tim - 1) + 1;
  return ret;
}
int main() {
  rd(n);
  rd(m);
  lim = n + m;
  int x, y;
  int rt = n;
  for (register int i = 1; i < n; ++i) {
    rd(x);
    rd(y);
    ++du[x];
    ++du[y];
    link(x, y);
    link(y, x);
  }
  for (register int i = 1; i <= n; ++i)
    if (du[i] == 1) q.push(i);
  int df = 0;
  while (!q.empty()) {
    int x = q.top();
    q.pop();
    t[x].tim = ++df;
    add(df, 1);
    for (register int i = hd[x]; i; i = e[i].nxt) {
      int y = e[i].to;
      if (du[y] > 1) {
        --du[y];
        if (du[y] == 1) q.push(y);
      }
    }
  }
  dfs(rt, 0);
  char s[233];
  while (m--) {
    scanf("%s", s + 1);
    if (s[1] == 'u') {
      ++df;
      rd(x);
      makert(x, df);
    } else if (s[1] == 'w') {
      rd(x);
      printf("%d\n", rk(x));
    } else {
      rd(x);
      rd(y);
      int A = rk(x), B = rk(y);
      printf("%d\n", A < B ? x : y);
    }
  }
  return 0;
}
}  // namespace Miracle
signed main() {
  Miracle::main();
  return 0;
}
