#include <iostream>
 #include <cstdio>
 #define inf 0x7fffffff
 #define N 20010
 #define M 20010
 using namespace std;
 int n,m;
 struct node *null;
 struct node
 {
     node *fa,*ch[];
     //node(int x,int flag);
     int maxn,minn,data,sum;
     bool rev,rev_data,ie;
     ];}
     ] && ];}
     void setc(node *x,int t) {this->ch[t]=x; x->fa=this;}
     void push_up();
     void push_down();
 }pool[N+M],*pt=pool,*e[M],*p[N];
 void node::push_up()
 {
     if (this==null) return;
     sum=ch[]->sum+ch[]->sum+data*ie;
     maxn=max(ch[]->maxn,ch[]->maxn); if (ie) maxn=max(maxn,data);
     minn=min(ch[]->minn,ch[]->minn); if (ie) minn=min(minn,data);
 }
 void node::push_down()
 {
     if (this==null) return;
     if (!isrt()) fa->push_down();
     if (rev)
     {
         ]!=]->rev^=;
         ]!=]->rev^=;
         swap(ch[],ch[]);
         rev=;
     }
     if (rev_data)
     {
         ]!=null)
         {
             ]->maxn;
             ch[]->rev_data^=;
             ch[]->data=-ch[]->data;
             ch[]->sum=-ch[]->sum;
             ch[]->maxn=-ch[]->minn;
             ch[]->minn=-k;
         }
         ]!=null)
         {
             ]->maxn;
             ch[]->rev_data^=;
             ch[]->sum=-ch[]->sum;
             ch[]->maxn=-ch[]->minn;
             ch[]->minn=-k;
             ch[]->data=-ch[]->data;
         }
     //    swap(ch[0],ch[1]);// 注意！！！
         rev_data=;
     }
 }
 namespace LCT
 {
     node *NewNode(int x,int flag)
     {
         node *r=pt++;
         r->fa=r->ch[]=r->ch[]=null;
         r->data=r->sum=x; r->ie=flag;
         if  (flag) r->maxn=r->minn=x;
         else r->maxn=-inf,r->minn=inf;
         r->rev=r->rev_data=;
         return r;
     }
     void rotate(node *x)
     {
         node *r=x->fa;
         if (r==null || x==null) return;
         x->push_down(); r->push_down();
         bool t=x->chr();
         if (r->isrt()) x->fa=r->fa; // ！！！在这里坑了好几次了
         else r->fa->setc(x,r->chr());
         r->setc(x->ch[t^],t);
         x->setc(r,!t);
         r->push_up(); x->push_up();
     }
     void Splay(node *x)
     {
         //if (x==null) return;
         x->push_down();
         for (;!x->isrt();rotate(x))
             if (!x->fa->isrt())
                 if (x->chr()==x->fa->chr()) rotate(x->fa);
                 else rotate(x);
         x->push_up();
     }
     void Access(node *x)
     {
         node *r=null;
         for (;x!=null;r=x,x=x->fa)
         {
             Splay(x);
             x->ch[]=r;
         }
     }
     ;}
     void Split(node *x,node *y) {MoveRoot(x); Access(y); Splay(y);}
     void Link(node *x,node *y) {MoveRoot(x); x->fa=y;}
     ]->fa=]=null;}
     void Change(node *x,int v) {Splay(x); x->data=v; x->push_up();}
     ; }
     int Query_Sum(node *x,node *y) {Split(x,y); return y->sum;}
     int Query_Max(node *x,node *y) {Split(x,y); return y->maxn;}
     int Query_Min(node *x,node *y) {Split(x,y); return y->minn;}
 }
 inline int read()
 {
     char c;
     ,f=;
     ;}
     ans=c-';
     +c-';
     return ans*f;
 }
 void init()
 {
     null=pt++;
     ]=]=null;
     ;
     ;
     null->maxn=-inf; null->minn=inf;
 }
 using namespace LCT;
 int main()
 {
 //    freopen("travel.in","r",stdin);
 //    freopen("travel.out","w",stdout);
     int x,y,z;
     n=read();
     init();
     ;i<n;i++) p[i]=NewNode(,);
     ;i<n;i++)
     {
         x=read(); y=read(); z=read();
         e[i]=NewNode(z,);
         Link(p[x],e[i]);Link(e[i],p[y]);
     }
     m=read();
     ];
     ;i<=m;i++)
     {
         scanf("%s",s);
         x=read(); y=read();
         ]=='C') Change(e[x],y);
         ]=='N') Data_Rev(p[x],p[y]);
         ]=='S') printf("%d\n",Query_Sum(p[x],p[y]));
         ]=='M')
             ]=='A')    printf("%d\n",Query_Max(p[x],p[y]));
             else printf("%d\n",Query_Min(p[x],p[y]));
     }
     ;
 }