Problem: Lena is playing with matches. The natural question arising in the head of any child playing with matches is whether it's possible to set a tree on fire with a matches, or not.

Let's say, that the tree is a connected graph without cycles and the vertices are labeled with integers 1, 2, …, n. Also every vertex v has some integer priority p_v associated with it. All priorities are distinct.

It turns out, that if you set a tree on fire, it will burn to nothing. However, this process doesn't happen instantly. At the beginning, burns out the leaf (a vertex is called to be a leaf if it has only one adjacent vertex) of the tree of the minimum priority. Then burns out the leaf of the minimal priority of the remaining tree, and so on. This way, the vertices turn into the leaves and burn out until only one vertex remains. Then this vertex burns out as well.

Lena has prepared a tree of n vertices and every vertex in it has a priority p_v = v. Lena is very curious about burning out this tree. However, she understands, that if she will burn the tree now, then it will disappear completely. Lena is a kind girl and she will feel bad for the burned tree, so she wants to study the process of burning the tree only in her mind. Lena wants to process q queries, each of them is one of three following types:

  * "up v", assign the vertex v priority 1 + max\\{p_1, p_2, …, p_n\}; 
  * "when v", find the step at which the vertex v will burn out, if the tree would be set on fire now; 
  * "compare v u", find out which of the vertices v and u will burn out first, if the tree would be set on fire now. 



Notice, that if all priorities would be distinct, then after the "up" query they will stay distinct as well. Initially all priorities are distinct, hence during any (purely hypothetical of course) burning of the tree, all leafs would have distinct priorities.

Input

The first line contains two integers n and q (2 ≤ n ≤ 200 000, 1 ≤ q ≤ 200 000) — the number of vertices in the tree and the number of queries.

The i-th of the following n - 1 lines contains two integers v_i, u_i (1 ≤ v_i, u_i ≤ n), denoting the endpoints of the i-th edge.

Each of the remaining q lines contains a query of one of the following three types:

  * "up v" (1 ≤ v ≤ n) — change the priority of vertex v; 
  * "when v" (1 ≤ v ≤ n) — determine the step at which the vertex v will burn out; 
  * "compare v u" (1 ≤ v, u ≤ n, v ≠ u) — determine which of vertices v and u will burn out earlier in the current tree. 



It's guaranteed, that there is at least one query of type "when" or "compare".

Output

For every query of type "when" print one integer in range from 1 to n — the step at which the vertex v will burn out.

For every query of type "compare" print either v or u, depending on which one will burn out earlier.

Examples

Input


5 7
1 5
1 2
1 3
4 3
when 1
when 2
when 3
when 4
when 5
compare 2 3
compare 3 4


Output


4
1
3
2
5
2
4


Input


5 5
1 5
1 2
1 3
4 3
up 1
compare 2 4
compare 4 3
compare 3 1
compare 1 5


Output


2
4
3
5

Note

In the first example, the process of burning of the tree is illustrated on the following picture:

<image>

In particular, the vertices of the tree will burn out in the following order: [2, 4, 3, 1, 5].

In the second example, after applying the "up" operation, the order of vertices will change to: [2, 4, 3, 5, 1].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline int Chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline int Chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline T read() {
  T sum = 0, fl = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fl = -1;
  for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - '0';
  return sum * fl;
}
inline void proc_status() {
  ifstream t("/proc/self/status");
  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
       << endl;
}
const int Maxn = 2e5 + 100;
int N, Q, M, color_cnt;
int e, Begin[Maxn], To[Maxn << 1], Next[Maxn << 1];
namespace BIT {
int sum[Maxn << 1];
inline void add(int first, int val) {
  for (; first <= M; first += (first & (-first))) sum[first] += val;
}
inline int query(int first) {
  int ans = 0;
  for (; first; first -= (first & (-first))) ans += sum[first];
  return ans;
}
}  // namespace BIT
namespace LCT {
struct info {
  int fa, ch[2], size, rev, col, tag;
} node[Maxn];
inline int is_root(int first) {
  return (node[(node[first].fa)].ch[0]) != first &&
         (node[(node[first].fa)].ch[1]) != first;
}
inline int judge_dir(int first) {
  return (node[(node[first].fa)].ch[1]) == first;
}
inline void connect(int first, int f, int dir) {
  node[f].ch[dir] = first, (node[first].fa) = f;
}
inline void push_up(int root) {
  node[root].size =
      node[(node[root].ch[0])].size + node[(node[root].ch[1])].size + 1;
}
inline void push_down(int first) {
  if (node[first].rev) {
    swap((node[first].ch[0]), (node[first].ch[1]));
    node[(node[first].ch[0])].rev ^= 1, node[(node[first].ch[1])].rev ^= 1;
    node[first].rev = 0;
  }
  if (node[first].tag) {
    node[(node[first].ch[0])].tag = node[(node[first].ch[0])].col =
        node[first].tag;
    node[(node[first].ch[1])].tag = node[(node[first].ch[1])].col =
        node[first].tag;
    node[first].tag = 0;
  }
}
inline void build(int first, int f) {
  (node[first].fa) = f, node[first].col = first;
  for (int i = Begin[first]; i; i = Next[i]) {
    int second = To[i];
    if (second == f) continue;
    build(second, first);
    if (Chkmax(node[first].col, node[second].col)) (node[first].ch[1]) = second;
  }
  push_up(first), BIT ::add(node[first].col, 1);
}
inline void rotate(int first) {
  int f = (node[first].fa), anc = (node[f].fa), dir_x = judge_dir(first),
      dir_f = judge_dir(f);
  if (!is_root(f)) node[anc].ch[dir_f] = first;
  (node[first].fa) = anc;
  connect(node[first].ch[dir_x ^ 1], f, dir_x);
  connect(f, first, dir_x ^ 1);
  push_up(f), push_up(first);
}
inline void splay(int first) {
  static int Stack[Maxn], top;
  Stack[top = 1] = first;
  for (int second = first; !is_root(second); second = (node[second].fa))
    Stack[++top] = (node[second].fa);
  while (top) push_down(Stack[top--]);
  for (; !is_root(first); rotate(first))
    if (!is_root((node[first].fa)))
      rotate(judge_dir(first) == judge_dir((node[first].fa)) ? (node[first].fa)
                                                             : first);
}
inline void access(int first, int col) {
  for (int second = 0; first; second = first, first = (node[first].fa)) {
    splay(first);
    BIT ::add(node[first].col, -(node[(node[first].ch[0])].size + 1));
    BIT ::add(col, node[(node[first].ch[0])].size + 1);
    (node[first].ch[1]) = second, push_up(first);
  }
}
inline void make_root(int first, int col) {
  access(first, col), splay(first);
  node[first].tag = node[first].col = col;
  node[first].rev ^= 1;
}
inline int query(int first) {
  splay(first);
  return BIT ::query(node[first].col - 1) + node[(node[first].ch[1])].size + 1;
}
}  // namespace LCT
inline void add_edge(int first, int second) {
  To[++e] = second, Next[e] = Begin[first], Begin[first] = e;
}
inline void Solve() {
  LCT ::build(N, 0);
  while (Q--) {
    char S[10];
    scanf("%s", S);
    int first = read<int>();
    if (S[0] == 'u')
      LCT ::make_root(first, ++color_cnt);
    else if (S[0] == 'w')
      printf("%d\n", LCT ::query(first));
    else {
      int second = read<int>();
      printf("%d\n", LCT ::query(first) < LCT ::query(second) ? first : second);
    }
  }
}
inline void Input() {
  N = color_cnt = read<int>(), Q = read<int>(), M = N + Q + 1;
  for (int i = 1; i < N; ++i) {
    int first = read<int>(), second = read<int>();
    add_edge(first, second), add_edge(second, first);
  }
}
int main() {
  Input();
  Solve();
  return 0;
}