/kk 求调

#include <bits/stdc++.h>
using namespace std;
int di[200005],din[200005],fa[200005],dep[200005],rk[200005],son[200005],top[200005],size[200005],n,m;
struct as{
	int v,w,nxt;
}edge[400005];
struct ll{
	int v,w,u;
}czmg[400005];
int head[200005],cnt,tot;
void add(int u,int v,int w){
	edge[++cnt].nxt=head[u];
	edge[cnt].v=v;
	edge[cnt].w=w;
	head[u]=cnt;
}
void dfs1(int u,int fat){
	dep[u]=dep[fat]+1;
	fa[u]=fat;
	size[u]=1;
	int maxx=-1e9;
	for (register int i=head[u];i;i=edge[i].nxt){
		int v=edge[i].v;
		if (v==fat){
			di[u]=edge[i].w;
			continue ;
		}
		dfs1(v,u);
		size[u]+=size[v];
		if (size[v]>maxx) maxx=size[v],son[u]=v;
	}
}
void dfs2(int u,int tp){
	top[u]=tp;
	rk[u]=++tot;
	din[tot]=di[u];
	if (!son[u]) return ;
	dfs2(son[u],tp);
	for (register int i=head[u];i;i=edge[i].nxt){
		int v=edge[i].v;
		if (v==fa[u]||v==son[u]) continue ;
		dfs2(v,v);
	}
	return ;
} 
struct tree{
	int s,minn,maxx,la;//1 cover 2 ~
}tr[800005];
void pushup(int u){
	tr[u].s=tr[u*2].s+tr[u*2+1].s;
	tr[u].minn=min(tr[u*2].minn,tr[u*2+1].minn);
	tr[u].maxx=max(tr[u*2].maxx,tr[u*2+1].maxx);
}
void pushdown(int u,int l,int r){
	if (l==r) return ;
	if (tr[u].la==1) return ;
	swap(tr[u*2].maxx,tr[u*2].minn);
	swap(tr[u*2+1].maxx,tr[u*2+1].minn);
	tr[u*2].s*=-1,tr[u*2+1].s*=-1;
	tr[u*2].maxx*=-1,tr[u*2].minn*=-1;
	tr[u*2+1].maxx*=-1,tr[u*2+1].minn*=-1;
	tr[u*2].la*=-1,tr[u*2+1].la*=-1;
	tr[u].la=1;
}
void build(int u,int l,int r){
	tr[u].maxx=-1e9,tr[u].minn=1e9,tr[u].la=1,tr[u].s=0;
	if (l==r){
		tr[u].s=tr[u].maxx=tr[u].minn=din[l];
		return ;
	}
	int mid=(l+r)/2;
	build(u*2,l,mid);
	build(u*2+1,mid+1,r);
	pushup(u);
}
void update1(int l,int r,int L,int R,int u,int la){
	if (l>=L&&r<=R){
		tr[u].s=la;
		tr[u].maxx=tr[u].minn=la;
		return ;
	}
	pushdown(u,l,r);
	int mid=(l+r)/2;
	if (mid>=L) update1(l,mid,L,R,u*2,la);
	if (mid<R) update1(mid+1,r,L,R,u*2+1,la);
	pushup(u);
}
void update2(int l,int r,int L,int R,int u){
	if (l>=L&&r<=R){
		tr[u].s*=-1;
		swap(tr[u].maxx,tr[u].minn);
		tr[u].maxx*=-1,tr[u].minn*=-1;
		tr[u].la*=-1;
		return ;
	}
	pushdown(u,l,r);
	int mid=(l+r)/2;
	if (mid>=L) update2(l,mid,L,R,u*2);
	if (mid<R) update2(mid+1,r,L,R,u*2+1);
	pushup(u);
}
void cha(int u,int v){
	while(top[u]!=top[v]){
		if (dep[top[u]]<dep[top[v]]) swap(u,v);
		update2(1,n,rk[top[u]],rk[u],1);
		u=fa[top[u]];
	}
	if (dep[u]>dep[v]) swap(u,v);
	update2(1,n,rk[u]+1,rk[v],1);
}
int getsum1(int l,int r,int L,int R,int u){
	if (l>=L&&r<=R) return tr[u].s;
	int ans=0,mid=(l+r)/2;
	pushdown(u,l,r);
	if (mid>=L) ans+=getsum1(l,mid,L,R,u*2);
	if (mid<R) ans+=getsum1(mid+1,r,L,R,u*2+1);
	return ans;
}
int getsum2(int l,int r,int L,int R,int u){
	if (l>=L&&r<=R) return tr[u].maxx;
	int ans=-1e9,mid=(l+r)/2;
	pushdown(u,l,r);
	if (mid>=L) ans=max(ans,getsum2(l,mid,L,R,u*2));
	if (mid<R) ans=max(ans,getsum2(mid+1,r,L,R,u*2+1));
	return ans;
}
int czmg2(int x,int y){
	int ans=0;
	while(top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]){
			swap(x,y);
		}
		ans+=getsum1(1,n,rk[top[x]],rk[x],1);
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	ans+=getsum1(1,n,rk[x]+1,rk[y],1);
	return ans;
}
int xs(int x,int y){
	int ans=-1e9;
	while(top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]){
			swap(x,y);
		}
		ans=max(ans,getsum2(1,n,rk[top[x]],rk[x],1));
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	ans=max(ans,getsum2(1,n,rk[x]+1,rk[y],1));
	return ans;
}
int getsum3(int l,int r,int L,int R,int u){
	if (l>=L&&r<=R) return tr[u].minn;
	int ans=1e9,mid=(l+r)/2;
	pushdown(u,l,r);
	if (mid>=L) ans=min(ans,getsum3(l,mid,L,R,u*2));
	if (mid<R) ans=min(ans,getsum3(mid+1,r,L,R,u*2+1));
	return ans;
}
int mcqh(int x,int y){
	int ans=1e9;
	while(top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]){
			swap(x,y);
		}
		ans=min(ans,getsum3(1,n,rk[top[x]],rk[x],1));
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	ans=min(ans,getsum3(1,n,rk[x]+1,rk[y],1));
	return ans;
}
int main(){
//	freopen("P1505_1.in","r",stdin);
//	freopen("qwq.out","w",stdout);
	cin >> n;
	for (register int i=1;i<=n-1;i++){
		int u,v,w;
		cin >> u >> v >> w;
		u++,v++;
		add(u,v,w);
		add(v,u,w);
		czmg[i].u=u,czmg[i].v=v,czmg[i].w=w;
	}
	dfs1(1,0);
	dfs2(1,1);
	build(1,1,n);
	cin >> m;
	while(m--){
		char op[20];
		scanf("%s",op);
		if (op[0]=='C'){
			int i,w;
			cin >> i >> w;
			i++;
			int u=czmg[i].u,v=czmg[i].v;
			if (dep[u]>dep[v]) swap(u,v);
			update1(1,n,rk[u],rk[u],1,w);
		}
		if (op[0]=='N'){
			int u,v;
			cin >> u >> v;
			u++,v++;
			cha(u,v);
		}
		if (op[0]=='S'){
			int u,v;
			cin >> u >> v;
			u++,v++;
			cout << czmg2(u,v) << endl;
		}
		if (op[0]=='M'&&op[1]=='A'){
			int u,v;
			cin >> u >> v;
			u++,v++;
			cout << xs(u,v) << endl;
		}
		if (op[0]=='M'&&op[1]=='I'){
			int u,v;
			cin >> u >> v;
			u++,v++;
			cout << mcqh(u,v) << endl;
		}
	}
}