#include<bits/stdc++.h>
#define N 100010
#define gc getchar
#define mid ((l+r)>>1)
using namespace std;

inline int rd(){
  int x=0; bool f=0; char c=gc();
  while(!isdigit(c)){if(c=='-')f=1;c=gc();}
  while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=gc();}
  return f?-x:x;
}

int n,m,tot,hd[N],fa[N],cnt[N];

struct edge{int to,nxt;}e[N<<1];

inline void add(int u,int v){
  e[++tot].to=v; e[tot].nxt=hd[u]; hd[u]=tot;
}

void dfs(int u){
  for(int i=hd[u],v;i;i=e[i].nxt)
    if((v=e[i].to)!=fa[u]){fa[v]=u;dfs(v);}
}

struct Q{int op,x,ans;}q[N];

struct UFS{
  int f[N];
  UFS(){memset(f,0,sizeof(f));}
  int find(int x){return x==f[x]?x:f[x]=find(f[x]);}
  inline void merge(int x,int fa){f[find(x)]=find(fa);}
}ufs;

int main(){
  n=rd(); m=rd();
  for(int i=1,u,v;i<n;++i){
    u=rd(); v=rd();
    add(u,v); add(v,u);
  }
  fa[1]=1;
  dfs(1); char c;
  for(int i=1;i<=m;++i){
    c=gc(); while(!isalpha(c)) c=gc();
    q[i].op=(c=='C'); q[i].x=rd();
    if(q[i].op){ufs.f[q[i].x]=q[i].x;++cnt[q[i].x];}
  }
  for(int i=1;i<=n;++i) if(!ufs.f[i]) ufs.f[i]=fa[i];
  for(int i=m;i;--i)
    if(q[i].op){
      --cnt[q[i].x];
      if(!cnt[q[i].x]) ufs.merge(q[i].x,fa[q[i].x]);
    }
    else q[i].ans=ufs.find(q[i].x);
  for(int i=1;i<=m;++i) if(!q[i].op) printf("%d\n",q[i].ans);
  return 0;
}