#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
using namespace std;
int read(){
	int x=0,f=1;char ch = getchar();
	while(ch<'0'||ch>'9'){if(ch=='-'){f=-1;}ch = getchar();}
	while(ch>='0'&&ch<='9'){x = x*10+ch-'0';ch = getchar();}
	return x*f;
}
const int N = 2e5+5;
int fa[N],dep[N],top[N],son[N],siz[N],n;
vector<int>ed[N];
void dfs1(int u,int f){
	siz[u] = 1;
	for(auto x:ed[u]){
		if(x==f){
			continue;
		}
		fa[x] = u;
		dep[x] = dep[u]+1;
		dfs1(x,u);
		siz[u]+=siz[x];
		if(siz[son[u]]<siz[x]){
			son[u] = x;
		}
	}
}
int dfn[N],tt,id[N];
void dfs2(int u,int t){
	top[u] = t;
	dfn[u] = ++tt;
	id[tt] = u;
	if(!son[u]){
		return;
	}
	dfs2(son[u],t);
	for(auto x:ed[u]){
		if(x==son[u]||x==fa[u]){
			continue;
		}
		dfs2(x,x);
	}
}
int Lca(int u,int v){
	while(top[u]!=top[v]){
		if(dep[top[u]]<dep[top[v]]){
			swap(u,v);
		}
		u = fa[top[u]];
	}
	if(dep[u]<dep[v]){
		swap(u,v);
	}
	return v;
}
int inf = 2e9;
int L[N],R[N];
struct seg{
	struct aa{
		int lc,rc;
		int mx,mi;
	}node[N*2];
	int tot;
	void build(int &u,int l,int r){
		u = ++tot;
		node[u].mi = -inf;
		node[u].mx = inf;
		if(l==r){
			return;
		}
		int mid = (l+r)/2;
		build(node[u].lc,l,mid);
		build(node[u].rc,mid+1,r);
	}
	void upd(int u,int l,int r,int ll,int rr,int x,int y){
		if(ll>rr){
			return;
		}
		if(l==ll&&r==rr){
//			cout<<"LR:"<<l<<" "<<r<<" "<<x<<"\n"; 
			if(y==0){
				node[u].mi = max(node[u].mi,x);
			}else{
				node[u].mx = min(node[u].mx,x);
			}
			return;
		}
		int mid = (l+r)/2;
		if(rr<=mid){
			upd(node[u].lc,l,mid,ll,rr,x,y);
		}else if(ll>mid){
			upd(node[u].rc,mid+1,r,ll,rr,x,y);
		}else{
			upd(node[u].lc,l,mid,ll,mid,x,y);
			upd(node[u].rc,mid+1,r,mid+1,rr,x,y);
		}
	}
	void dfs(int u,int l,int r,int x,int y){
		x = max(node[u].mi,x);
		y = min(node[u].mx,y);
		if(l==r){
			L[id[l]] = x;
			R[id[l]] = y;
			return;
		}
		int mid = (l+r)/2;
		dfs(node[u].lc,l,mid,x,y);
		dfs(node[u].rc,mid+1,r,x,y);
	}
}T;
int rt;
void add(int u,int v,int x,int y){//y0最小值 
	while(top[u]!=top[v]){
		if(dep[top[u]]<dep[top[v]]){
			swap(u,v);
		}
		T.upd(rt,1,n,dfn[top[u]],dfn[u],x,y);
		u = fa[top[u]];
	}
	if(dep[u]<dep[v]){
		swap(u,v);
	}
	T.upd(rt,1,n,dfn[v]+1,dfn[u],x,y);
}
map<int,int>mp;
int s,t;
int head[N],tote=1;
struct bb{
	int nxt,to,val;
}edge[N*4];
struct flow{
	
	void link(int u,int v,int w){
//		cout<<"UV:"<<u<<" "<<v<<"\n";
		edge[++tote] = (bb){head[u],v,w};head[u] = tote;
		edge[++tote] = (bb){head[v],u,0};head[v] = tote;
	}
	queue<int>q;
	int d[N];
	bool bfs(){
		memset(d,0,sizeof(d));
		d[s] = 1;
		q.push(s);
		while(!q.empty()){
			int u = q.front();
			q.pop();
			for(int i=head[u];i;i=edge[i].nxt){
				int now = edge[i].to;
				if(!d[now]&&edge[i].val){
					d[now] = d[u]+1;
					q.push(now);
				}
			}
		}
		return d[t]; 
	}
	int dfs(int u,int f){
		if(u==t){
			return f;
		}
		int used = 0;
		for(int i=head[u];i&&f;i=edge[i].nxt){
			int now = edge[i].to;
			if(d[now]==d[u]+1&&edge[i].val){
				int w = dfs(now,min(f,edge[i].val));
				used+=w;f-=w;
				edge[i].val-=w;edge[i^1].val+=w;
			}
		}
		if(!used){
			d[u] = 0;
		}
		return used;
	}
	int ans;
	void dinic(){
		ans = 0;
		while(bfs()){
			ans+=dfs(s,inf);
		}
	}
}F;
int ans[N];
int main(){
//	freopen("ex_tree2.in","r",stdin);
//	freopen("me.txt","w",stdout); 
	n = read();
	for(int i=1;i<n;i++){
		int u,v;
		u = read();v = read();
		ed[u].push_back(v);
		ed[v].push_back(u);
	}
	dfs1(1,1);
	dfs2(1,1);
	T.build(rt,1,n);
	int m = read();
	s = 0;t = n+m+1;
	for(int i=1;i<=m;i++){
		char ch[5];int u,v,x;
		scanf("%s",ch);u = read();v = read();x = read();
		mp[x] = i;
		if(ch[0]=='m'){
			add(u,v,x,0);
		}else{
			add(u,v,x,1);
		}
		F.link(i+n,t,1);
	}
	T.dfs(rt,1,n,-inf,inf);
	
	for(int i=1;i<=n;i++){
		F.link(s,i,1);
		if(mp[L[i]]){
			F.link(i,mp[L[i]]+n,1);
		}
		if(mp[R[i]]){
			F.link(i,mp[R[i]]+n,1);
		}
//		cout<<"LR:"<<i<<" "<<L[i]<<" "<<R[i]<<"\n";
	}
	F.dinic();
//	cout<<F.ans<<"\n";
	for(int i=1;i<=n;i++){
		ans[i] = L[i];
		for(int j=head[i];j;j=edge[j].nxt){
			if(edge[j].val){
				continue;
			}
			int now = edge[j].to;
			if(now>n){
				if(now-n==mp[L[i]]){
					ans[i] = L[i];
				}else{
					ans[i] = R[i];
				}
			}
		}
	}
	for(int i=2;i<=n;i++){
		cout<<fa[i]<<" "<<i<<" "<<ans[i]<<"\n";
	}
	return 0;
}