#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int w = 1, s = 0;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return w * s;
}
struct node {
  int to, next;
} e[1000010];
struct Bit {
  int Sum[500010];
  inline int lowbit(int x) { return x & (-x); }
  inline void add(int pos, int d) {
    while (pos <= 5e5) Sum[pos] += d, pos += lowbit(pos);
  }
  inline int Qry(int pos) {
    int res = 0;
    while (pos) res += Sum[pos], pos -= lowbit(pos);
    return res;
  }
} fw;
int n, Q, tot, h[200010], fa[200001], rev[200010], tag[200010], tim[200010],
    cnt, ch[200010][2], size[200010];
inline void add(int from, int to) {
  e[++tot].next = h[from];
  h[from] = tot;
  e[tot].to = to;
}
inline void DFS(int now, int ffa) {
  fa[now] = ffa;
  tim[now] = now;
  size[now] = 1;
  for (register int i = h[now]; i; i = e[i].next) {
    int to = e[i].to;
    if (to == ffa) continue;
    DFS(to, now);
    tim[now] = max(tim[now], tim[to]);
  }
  for (register int i = h[now]; i; i = e[i].next) {
    int to = e[i].to;
    if (to == ffa) continue;
    if (tim[now] == tim[to]) ch[now][1] = to, size[now] = size[to] + 1;
  }
  fw.add(tim[now], 1);
}
inline int isroot(int x) { return ch[fa[x]][1] != x && ch[fa[x]][0] != x; }
inline int getf(int x) { return ch[fa[x]][1] == x; }
inline void Pushup(int x) { size[x] = size[ch[x][1]] + size[ch[x][0]] + 1; }
inline void Push1(int x) {
  if (!x) return;
  rev[x] ^= 1;
  swap(ch[x][0], ch[x][1]);
}
inline void Push2(int x, int y) {
  if (!x) return;
  tag[x] = tim[x] = y;
}
inline void Pushdown(int now) {
  if (rev[now]) Push1(ch[now][0]), Push1(ch[now][1]), rev[now] = 0;
  if (tag[now])
    Push2(ch[now][0], tag[now]), Push2(ch[now][1], tag[now]), tag[now] = 0;
}
inline void Rotate(int x) {
  int old = fa[x], oldf = fa[old], whichx = getf(x);
  if (!isroot(old)) ch[oldf][getf(old)] = x;
  fa[x] = oldf;
  ch[old][whichx] = ch[x][whichx ^ 1];
  fa[ch[old][whichx]] = old;
  ch[x][whichx ^ 1] = old;
  fa[old] = x;
  Pushup(old);
  Pushup(x);
}
int Sta[1000100];
inline void Splay(int x) {
  int top;
  Sta[top = 1] = x;
  for (register int i = x; !isroot(i); i = fa[i]) Sta[++top] = fa[i];
  for (register int i = top; i; --i) Pushdown(Sta[i]);
  for (register int f; !isroot(x); Rotate(x))
    if (!isroot(f = fa[x])) Rotate(getf(f) == getf(x) ? f : x);
  Pushup(x);
}
inline void Access(int v, int o) {
  int t = 0;
  for (; v; t = v, v = fa[v]) {
    Splay(v);
    ch[v][1] = 0;
    Pushup(v);
    fw.add(tim[v], -size[v]);
    ch[v][1] = t;
    Push2(v, o);
    fw.add(tim[v], size[v]);
    Pushup(v);
  }
}
inline int get(int x) {
  Splay(x);
  return fw.Qry(tim[x]) - size[ch[x][0]];
}
int main() {
  n = read(), Q = read();
  for (register int i = 1; i < n; ++i) {
    int x = read(), y = read();
    add(x, y);
    add(y, x);
  }
  DFS(n, 0);
  cnt = n + 1;
  for (register int i = 1; i <= Q; ++i) {
    char s[10];
    scanf("%s", s + 1);
    if (s[1] == 'u') {
      int x = read();
      Access(x, cnt);
      Splay(x);
      Push1(x);
      ++cnt;
    } else if (s[1] == 'w') {
      int x = read();
      cout << get(x) << "\n";
    } else {
      int a = read(), b = read();
      int x = get(a), y = get(b);
      cout << (x > y ? b : a) << "\n";
    }
  }
  return 0;
}
