#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<vector>
using namespace std;typedef long long LL;
const int maxn=100010;
int n,m,u,v,rt;
LL ans,sz;
char s[maxn];
int h[maxn],cnt=0;
struct edge{int to,next;
}G[maxn<<1];
int pos[maxn],ed[maxn],tot=0;
vector<int>V[maxn];
LL S[maxn<<2];
int Add[maxn<<2];
int siz[maxn];
bool cmp(const int &x,const int &y){return pos[x]<pos[y];
}
void add(int x,int y){++cnt;G[cnt].to=y;G[cnt].next=h[x];h[x]=cnt;
}
void push_down(int o,int L,int mid,int R){int cl=(o<<1),cr=(o<<1|1);int now=Add[o];Add[o]=0;S[cl]+=now*(mid-L+1);Add[cl]+=now;S[cr]+=now*(R-mid);Add[cr]+=now;
}
void UPD(int o,int L,int R,int x,int y,int v){if(L>=x&&R<=y){S[o]=S[o]+v*(R-L+1);Add[o]+=v;return;}int mid=(L+R)>>1;if(Add[o]!=0)push_down(o,L,mid,R);if(y<=mid)UPD(o<<1,L,mid,x,y,v);else if(x>mid)UPD(o<<1|1,mid+1,R,x,y,v);else {UPD(o<<1,L,mid,x,y,v);UPD(o<<1|1,mid+1,R,x,y,v);}S[o]=S[o<<1]+S[o<<1|1];
}
LL ask(int o,int L,int R,int x,int y){if(L>=x&&R<=y)return S[o];int mid=(L+R)>>1;if(Add[o]!=0)push_down(o,L,mid,R);if(y<=mid)return ask(o<<1,L,mid,x,y);else if(x>mid)return ask(o<<1|1,mid+1,R,x,y);else return ask(o<<1,L,mid,x,y)+ask(o<<1|1,mid+1,R,x,y);
}
int find_pos(int u,int v){int L=0,R=V[u].size()-1;while(L<R){int mid=L+((R-L+1)>>1);int now=V[u][mid];if(pos[v]>=pos[now])L=mid;else R=mid-1;}return V[u][L];
}
void Get_modify(int u,int val){if(u==rt)UPD(1,1,n,1,n,val);else if(pos[rt]<=ed[u]&&pos[rt]>=pos[u]){int v=find_pos(u,rt);UPD(1,1,n,1,n,val);UPD(1,1,n,pos[v],ed[v],-val);}else UPD(1,1,n,pos[u],ed[u],val);
}
LL Get_ans(int u){if(u==rt)return ask(1,1,n,1,n);else if(pos[rt]<=ed[u]&&pos[rt]>=pos[u]){int v=find_pos(u,rt);LL A=ask(1,1,n,1,n);LL B=ask(1,1,n,pos[v],ed[v]);return A-B;}else return ask(1,1,n,pos[u],ed[u]);
}
int Get_sz(int u){if(u==rt)return n;else if(pos[rt]<=ed[u]&&pos[rt]>=pos[u]){int v=find_pos(u,rt);return n-siz[v];}else return siz[u];
}
struct link_cut_tree{int fa[maxn],c[maxn][2];int rev[maxn],L[maxn],R[maxn];#define fa(u) fa[u]#define c(u,i) c[u][i]#define rev(i) rev[i]#define L(i) L[i]bool isroot(int u){return c(fa(u),0)!=u&&c(fa(u),1)!=u;}void pre(int p){if(!isroot(p))pre(fa(p));down(p);}void flip(int u){swap(c(u,0),c(u,1));swap(L[u],R[u]);rev(u)^=1;}void init(){for(int i=1;i<=n;++i)L[i]=i,R[i]=i;}void down(int u){if(rev(u)){if(c(u,0))flip(c(u,0));if(c(u,1))flip(c(u,1));rev(u)=0;}return;}void up(int u){if(c(u,0))L[u]=L[c(u,0)];else L[u]=u;if(c(u,1))R[u]=R[c(u,1)];else R[u]=u;}void rotate(int p,int x){int mark= p==c(x,1),y=c(p,mark^1),z=fa(x);if(c(z,0)==x)c(z,0)=p;if(c(z,1)==x)c(z,1)=p;if(y)fa(y)=x;fa(p)=z;c(p,mark^1)=x;fa(x)=p;c(x,mark)=y;up(x);}void Splay(int p){pre(p);while(!isroot(p)){int x=fa(p),y=fa(x);if(isroot(x))rotate(p,x);else if(p==c(x,0)^x==c(y,0))rotate(p,x),rotate(p,y);else rotate(x,y),rotate(p,x);}up(p);return;}void Access(int u){for(int v=0;u;u=fa(u)){Splay(u);fa(v)=u;if(c(u,1))Get_modify(L[c(u,1)],1);c(u,1)=v;if(v)Get_modify(L[v],-1);v=u;}return;}void make_root(int u){Access(u);Splay(u);flip(u);}
}LCT;void read(int &num){num=0;char ch=getchar();while(ch<'!')ch=getchar();while(ch>='0'&&ch<='9')num=num*10+ch-'0',ch=getchar();
}
void Get_DFS(int u,int f){pos[u]=++tot;siz[u]=1;LCT.fa[u]=f;for(int i=h[u];i;i=G[i].next){int v=G[i].to;if(v==f)continue;V[u].push_back(v);Get_DFS(v,u);siz[u]+=siz[v];}ed[u]=tot;
}int main(){read(n);read(m);for(int i=1;i<n;++i){read(u);read(v);add(u,v);add(v,u);}Get_DFS(1,0);rt=1;LCT.init();for(int i=1;i<=n;++i)sort(V[i].begin(),V[i].end(),cmp);for(int i=1;i<=n;++i)UPD(1,1,n,pos[i],ed[i],1);for(int i=1;i<=m;++i){scanf("%s",s+1);read(u);if(s[3]=='Q'){ans=Get_ans(u);sz=Get_sz(u);printf("%.10lf\n",(double)(ans)/(double)(sz));}else if(s[3]=='L'){LCT.Access(u);}else{//rt=u;LCT.make_root(u);rt=u;}}return 0;
}

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std; typedef long long LL;
const int maxn=500010;
const int mod=1e9+7;
int n;
LL jc[maxn],inv[maxn];
LL f[maxn],g[maxn];
LL ans=0; LL pow_mod(LL v,int p){ LL tmp=1; while(p){ if(p&1)tmp=tmp*v%mod; v=v*v%mod;p>>=1; }return tmp;
}
LL C(int n,int m){ return jc[n]*inv[m]%mod*inv[n-m]%mod;
} int main(){ scanf("%d",&n); jc[0]=1; for(int i=1;i<=n;++i)jc[i]=jc[i-1]*i%mod; inv[n]=pow_mod(jc[n],mod-2); for(int i=n-1;i>=0;--i)inv[i]=inv[i+1]*(i+1)%mod; f[0]=1;f[1]=0; for(int i=2;i<=n;++i)f[i]=(f[i-1]+f[i-2])*(i-1)%mod; g[0]=1;g[1]=0;g[2]=1; for(int i=3;i<=n;++i)g[i]=g[i-1]*(i-1)%mod; for(int k=2;k<=n;++k){ int cnt=0; LL tmp=1; for(int j=k;j<=n;j+=k){ cnt++; tmp=tmp*C(n-j+k,k)%mod; tmp=tmp*g[k]%mod; if(cnt&1)ans=ans+tmp*inv[cnt]%mod*f[n-j]%mod; else ans=ans-tmp*inv[cnt]%mod*f[n-j]%mod; if(ans<0)ans+=mod; if(ans>=mod)ans-=mod; } }printf("%lld\n",(ans%mod+mod)%mod); return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std; const int maxn=1010;
const int oo=0x7fffffff;
const int mod=1e9+7;
int n,m,u,v;
int deg[maxn];
int a[maxn];
int Num[maxn];
int dp[maxn];
bool vis[maxn][maxn]; void read(int &num){ num=0;char ch=getchar(); while(ch<'!')ch=getchar(); while(ch>='0'&&ch<='9')num=num*10+ch-'0',ch=getchar();
} int main(){ read(n);read(m); for(int i=1;i<=m;++i){ read(u);read(v); if(u>v)swap(u,v); deg[u]++; } for(int i=1;i<=n;++i)Num[i]=i; for(int i=1;i<=n;++i){ int now=deg[i]+1; a[i]=Num[now]; for(int j=now;j<=n;++j)Num[j]=Num[j+1]; } n++;a[0]=0;a[n]=n; for(int i=0;i<=n;++i){ int mn=oo; for(int j=i+1;j<=n;++j){ if(a[j]>a[i]){ if(mn>a[j])vis[i][j]=true; mn=min(mn,a[j]); } } } dp[0]=1; for(int i=1;i<=n;++i){ for(int j=0;j<i;++j){ if(vis[j][i]){ dp[i]+=dp[j]; if(dp[i]>=mod)dp[i]-=mod; } } }printf("%d\n",(dp[n]%mod+mod)%mod); return 0;
}