#include<bits/stdc++.h>

 #define ms(a,x) memset(a,x,sizeof(a))

 using namespace std;

 const int N=,M=1e7;

 struct node{int y,nxt;}e[N*];

 int t,n,k,s,c=,hs,pd,nt,h[N];

 int w[N],siz[N],vis[N],tp[N],tt[N];

 void add(int x,int y){

     e[++c]=(node){y,h[x]};h[x]=c;

     e[++c]=(node){x,h[y]};h[y]=c;

 } int sg1(int x){return x;}

 int sg2(int x){return (x+)%(s+)?x&:;}

 int sg3(int x){return x/s;}

 int sg4(int x){

     switch(x%){

         case : return x-;

         case : return x+;

         default : return x;

     }

 } void init(){

     ms(h,);ms(vis,);c=;

 } void gs(int x,int fa){

     siz[x]=;

     for(int i=h[x],y;i;i=e[i].nxt)

     if((y=e[i].y)!=fa&&!vis[y])

     gs(y,x),siz[x]+=siz[y];

 } int gg(int x,int fa){

     for(int i=h[x],y;i;i=e[i].nxt)

     if((y=e[i].y)!=fa&&!vis[y]&&siz[y]>=hs)

     return gg(y,x);return x;

 } void dfs(int x,int fa,int o){

     tt[nt]=x;tp[nt++]=o;

     for(int i=h[x],y;i;i=e[i].nxt)

     if((y=e[i].y)!=fa&&!vis[y]) dfs(y,x,o^w[y]);

 } struct Hash{

     static const int P1=,P2=;

     int h1(int x){return x%P1;}

     int h2(int x){return x%P2;}

     int t1[P1],t2[P2],st[N],top;

     Hash(){ms(t1,-);ms(t2,-);}

     int find(int x){

         return t1[h1(x)]==x||t2[h2(x)]==x;

     } void insert(int x){

         if(find(x)) return ;

         int h=h2(x);st[top++]=x;

         if(t2[h]==-) t2[h]=x;

         else while(~x){

             h=h1(x);swap(x,t1[h]);

             if(x==-) return ;

             h=h2(x);swap(x,t2[h]);

         }

     } void del(int x){

         if(t1[h1(x)]==x) t1[h1(x)]=-;

         else t2[h2(x)]=-;

     } void clear(){

         while(top) del(st[--top]);

     }

 }H;void dc(int x){

     gs(x,);hs=siz[x]>>;int g;

     g=gg(x,);vis[g]=;H.insert();

     for(int i=h[g],y;i;i=e[i].nxt)

     if(!vis[y=e[i].y]){

         nt=;dfs(y,,w[y]);

         for(int j=;j<nt;j++)

         if(H.find(w[g]^tp[j]))

         {pd=;break;}

         for(int j=;j<nt;j++)

         H.insert(tp[j]);

     } H.clear();

     for(int i=h[g],y;i&&!pd;i=e[i].nxt)

     if(!vis[y=e[i].y]) dc(y);return ;

 } int main(){

     scanf("%d",&t);while(t--){

         init();scanf("%d",&n);

         for(int i=,y,x;i<n;i++)

         scanf("%d%d",&x,&y),add(x,y);

         for(int i=;i<=n;i++)

         scanf("%d",&w[i]);scanf("%d",&k);

         int (*sg)(int);

         if(k==) sg=sg1;

         else if(k==) scanf("%d",&s),sg=sg2;

         else if(k==) scanf("%d",&s),sg=sg3;

         else sg=sg4;pd=;

         for(int i=;i<=n;i++)

         if(!(w[i]=sg(w[i]))) pd=;

         if(!pd) dc();

         puts(pd?"Mutalisk ride face how to lose?":

         "The commentary cannot go on!");

     } return ;

 }