#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mpr make_pair
#define fr first
#define sc second
inline int read(){
	int res=0,f=1;char c=getchar();
	while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
	while (c>='0'&&c<='9') {res=res*10+(c-'0');c=getchar();}
	return res*f;
}
int n,q,r,val;
vector<pair<int,int> >e[500005];
pair<int,int>ta[500005];
//预处理 1, 处理节点深度, 子树大小, 父亲节点和重子叶子节点 
int dep[500005],siz[500005],fa[500005],son[500005];
int dfs(int u,int father){
	dep[u]=dep[father]+1;
	fa[u]=father;
	siz[u]=1;
	int maxn=-1;
	for (auto v:e[u]){
		if (v.fr==father) continue;
		int sizes=dfs(v.fr,u);
		siz[u]+=sizes;
		if (sizes>maxn) maxn=sizes,son[u]=v.fr;
	}
	return siz[u];
}
//预处理 2, 处理节点的 dfs 序, 节点所在重链对应的顶点 
int dfn[500005],top[500005],tip=1;
void dfs2(int u,int father,int op){
	if (op==1) top[u]=top[father];
	dfn[u]=tip++;
	if (son[u]!=0) dfs2(son[u],u,1);
	for (auto v:e[u]){
		if (v.fr==father||v.fr==son[u]) continue;
		dfs2(v.fr,u,0);
	}
}
//预处理总函数
int va[500005];
void init(int root){
	dfs(root,0);
	for (int i=1;i<=n;i++) top[i]=i;
	dfs2(root,0,0);
	for (int i=1;i<=n;i++){
		for (auto j:e[i]){
			int u=i,v=j.fr,w=j.sc;
			if (dep[u]<dep[v]) swap(u,v);
			va[u]=w;
		}
	}
	for (int i=1;i<n;i++) if (dep[ta[i].fr]>dep[ta[i].sc]) swap(ta[i].fr,ta[i].sc);
}
//分块
struct block_array{
	int a[500005],block[500005],tag[500005],sum[500005],maxn[500005],minn[500005];
	void build(){
		for (int i=1;i<=n;i++){
			block[i]=(i-1)/val+1;
			maxn[block[i]]=-1e18;
			minn[block[i]]=1e18;
			tag[block[i]]=1;
		}
	}
	void Change(int op,int x,int y){
		int bl=block[x];
		if (op!=0){
			sum[bl]-=a[x];
			if (maxn[bl]==a[x]||minn[bl]==a[x]){
				a[x]=y*tag[bl],maxn[bl]=-1e18,minn[bl]=1e18;
		        for (int i=(bl-1)*val+1;i<=(bl-1)*val+val;i++){
					maxn[bl]=max(maxn[bl],a[i]);
					minn[bl]=min(minn[bl],a[i]);
				}
			}
		}
		a[x]=y*tag[bl];
		sum[bl]+=a[x];
		maxn[bl]=max(maxn[bl],a[x]);
		minn[bl]=min(minn[bl],a[x]);
	}
	void Opposite(int x,int y){
		if (x>y) swap(x,y);
		if (block[x]==block[y]){
			for (int i=x;i<=y;i++) Change(1,i,-a[i]);
			return;
		}
		for (int i=x;i<=block[x]*val;i++) Change(1,i,-a[i]);
		for (int i=y;i>=(block[y]-1)*val+1;i--) Change(1,i,-a[i]);
		for (int i=block[x]+1;i<=block[y]-1;i++) tag[i]*=-1;
	}
	int Getsum(int x,int y){
		if (x>y) swap(x,y);
		int res=0;
		if (block[x]==block[y]){
			for (int i=x;i<=y;i++) res+=a[i]*tag[block[i]];
			return res;
		}
		for (int i=x;i<=block[x]*val;i++) res+=a[i]*tag[block[i]];
		for (int i=y;i>=(block[y]-1)*val+1;i--) res+=a[i]*tag[block[i]];
		for (int i=block[x]+1;i<=block[y]-1;i++) res+=sum[i]*tag[i];
		return res;
	}
	int Getmax(int x,int y){
		if (x>y) swap(x,y);
		int res=-1e18;
		if (block[x]==block[y]){
			for (int i=x;i<=y;i++) res=max(res,a[i]*tag[block[i]]);
			return res;
		}
		for (int i=x;i<=block[x]*val;i++) res=max(res,a[i]*tag[block[i]]);
		for (int i=y;i>=(block[y]-1)*val+1;i--) res=max(res,a[i]*tag[block[i]]);
		for (int i=block[x]+1;i<=block[y]-1;i++){
			if (tag[i]==1) res=max(res,maxn[i]*tag[i]);
			else res=max(res,minn[i]*tag[i]);
		}
		return res;
	}
	int Getmin(int x,int y){
		if (x>y) swap(x,y);
		int res=1e18;
		if (block[x]==block[y]){
			for (int i=x;i<=y;i++) res=min(res,a[i]*tag[block[i]]);
			return res;
		}
		for (int i=x;i<=block[x]*val;i++) res=min(res,a[i]*tag[block[i]]);
		for (int i=y;i>=(block[y]-1)*val+1;i--) res=min(res,a[i]*tag[block[i]]);
		for (int i=block[x]+1;i<=block[y]-1;i++){
			if (tag[i]==1) res=min(res,minn[i]*tag[i]);
			else res=min(res,maxn[i]*tag[i]);
		}
		return res;
	}
}book;
//操作 
inline void OppositePath(int x,int y){
	while (top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		book.Opposite(dfn[top[x]],dfn[x]);
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	if (x!=y) book.Opposite(dfn[son[x]],dfn[y]);
}
inline int QuerySum(int x,int y){
	int res=0;
	while (top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		res+=book.Getsum(dfn[top[x]],dfn[x]);
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	if (x!=y) res+=book.Getsum(dfn[son[x]],dfn[y]);
	return res;
}
inline int QueryMax(int x,int y){
	int res=-1e18;
	book.Change(1,1,-1e18);
	while (top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		res=max(res,book.Getmax(dfn[top[x]],dfn[x]));
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	if (x!=y) res=max(res,book.Getmax(dfn[son[x]],dfn[y]));
	book.Change(1,1,0);
	return res;
}
inline int QueryMin(int x,int y){
	int res=1e18;
	while (top[x]!=top[y]){
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		res=min(res,book.Getmin(dfn[top[x]],dfn[x]));
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	if (x!=y) res=min(res,book.Getmin(dfn[son[x]],dfn[y]));
	book.Change(1,1,0);
	return res;
}
//主函数 
signed main(){
	n=read(),r=1,val=sqrt(n);
	for (int i=1;i<n;i++){
		int u=read()+1,v=read()+1,w=read();
		ta[i]=mpr(u,v);
		e[u].push_back(mpr(v,w));
		e[v].push_back(mpr(u,w));
	}
	init(r);
	book.build();
	for (int i=2;i<=n;i++) book.Change(0,dfn[i],va[i]);
	q=read();
	while (q--){
		string op;cin>>op;
		if (op=="C"){
			int x=read(),y=read();
			book.Change(1,dfn[ta[x].sc],y);
		}
		if (op=="N"){
			int x=read()+1,y=read()+1;
			OppositePath(x,y);
		}
		if (op=="SUM"){
			int x=read()+1,y=read()+1;
			if (x==y) cout<<0<<'\n';
			else cout<<QuerySum(x,y)<<'\n';
		}
		if (op=="MAX"){
			int x=read()+1,y=read()+1;
			if (x==y) cout<<0<<'\n';
			else cout<<QueryMax(x,y)<<'\n';
		}
		if (op=="MIN"){
			int x=read()+1,y=read()+1;
			if (x==y) cout<<0<<'\n';
			else cout<<QueryMin(x,y)<<'\n';
		}
	}
	return 0;
}

WA#12