#include <cstdio>
#include <algorithm>
#include <cstring> 
#include <vector>
#include <cassert>
#include <random>
#include <map>
#include <ctime>
#include <queue> 
#define int long long
using namespace std;

const int md=998244353;
void read(int &x){
	x=0;
	int f=1;
	char c=getchar();
	while(!('0'<=c && c<='9')){
		if(c=='-'){
			f=-1;
		}
		c=getchar();
	} 
	while('0'<=c && c<='9'){
		x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
	x*=f;
}
struct Vector{
	int a[3];
	Vector(){
		memset(a,0,sizeof(a));
	}
	int &operator[](int k){
		return a[k];
	}
} vs[200010];
struct Matrix{
	int a[3][3];
	Matrix(){
		memset(a,0,sizeof(a));
	}
	Matrix(Vector v){
		memset(a,0,sizeof(a));
		a[0][1]=v[2];
		a[0][2]=md-v[1];
		a[1][0]=md-v[2];
		a[1][2]=v[0];
		a[2][0]=v[1];
		a[2][1]=md-v[0];
	}
	int *operator[](int k){
		return a[k];
	}
	friend Matrix operator*(Matrix a,Matrix b){
		Matrix res;
		for(int i=0;i<3;i++){
			for(int j=0;j<3;j++){
				for(int k=0;k<3;k++){
					res[i][j]=(res[i][j]+a[i][k]*b[k][j])%md;
				}
			}
		}
		return res;
	}
	friend Vector operator*(Matrix a,Vector b){
		Vector res;
		for(int i=0;i<3;i++){
			for(int j=0;j<3;j++){
				res[i]=(res[i]+a[i][j]*b[j])%md;
			}
		}
		return res;
	}
	void show(){
		for(int i=0;i<3;i++){
			for(int j=0;j<3;j++){
				printf("%lld ",a[i][j]);
			}
			putchar('\n');
		}
	}
};
int tr[200010][2],fa[200010],siz[200010],sum[200010],hd[200010],bck[200010];
int n,q,ext=1;
namespace ds{
	Matrix val[200010],sum[200010];
	int fa[200010],tr[200010][2];
	void init(){
		Matrix res;
		res[0][0]=res[1][1]=res[2][2]=1;
		fill(val,val+200005,res);
		fill(sum,sum+200005,res);
	}
	void pushup(int k){
		//printf("[!!%lld]",k);
		sum[k]=sum[tr[k][0]]*val[k]*sum[tr[k][1]];
	}
	bool isroot(int k){
		return !(tr[fa[k]][0]==k || tr[fa[k]][1]==k);
	}
	bool get(int k){
		return tr[fa[k]][1]==k;
	}
	Vector query(int k){
		Matrix res=val[k]*sum[tr[k][1]];
		Vector cur=::vs[::bck[::hd[k]]];
		while(fa[k]){
			if(!get(k)){
				res=res*val[fa[k]]*sum[tr[fa[k]][1]];
			}
			k=fa[k];
		}
		return res*cur;
	}
	void update(int k){
		while(k){
			while(!isroot(k)){
				k=fa[k];
				pushup(k);
			}
			if(!fa[k]){
				break;
			}
			Vector v=sum[k]*::vs[::bck[::hd[k]]];
			val[fa[k]]=Matrix(v);
			pushup(fa[k]);
			k=fa[k];
		}
	}
	void show(){
		for(int i=1;i<=n;i++){
			printf("%lld(%lld %lld):%lld %d\n",i,tr[i][0],tr[i][1],fa[i],isroot(i));
			val[i].show();
			putchar('\n');
			sum[i].show();
			putchar('\n');
		}
	}
};
void dfs(int k,int f){
	siz[k]=1;
	fa[k]=f;
	if(!tr[k][0]){
		return;
	}
	dfs(tr[k][0],k);
	dfs(tr[k][1],k);
	siz[k]+=siz[tr[k][0]]+siz[tr[k][1]];
	if(siz[tr[k][1]]>siz[tr[k][0]]){
		swap(tr[k][0],tr[k][1]);
		ext=ext*(md-1)%md;
	}
	sum[k]=siz[tr[k][1]]+1;
}
int build(int u,int v){//u is ancestor of v
	//printf("[?%lld %lld]",u,v);
	if(u==v){
		ds::pushup(u);
		return u;
	}
	int cur=v;
	while(cur!=u && (sum[cur]-sum[fa[u]])*2>(sum[v]-sum[fa[u]])){
		cur=fa[cur];
	}
	if(cur!=u){
		ds::tr[cur][0]=build(u,fa[cur]);
		ds::fa[ds::tr[cur][0]]=cur;
	}
	ds::tr[cur][1]=build(tr[cur][0],v);
	ds::fa[ds::tr[cur][1]]=cur;
	ds::pushup(cur);
	return cur;
}
void dfs2(int k,int f){
	//printf("[%lld %lld]",k,f);
	sum[k]+=sum[f];
	if(!hd[k]){
		hd[k]=k;
	}
	if(!tr[k][0]){
		bck[hd[k]]=k;
	}else{
		hd[tr[k][0]]=hd[k];
		dfs2(tr[k][0],k);
		dfs2(tr[k][1],k);
		ds::val[k]=Matrix(vs[tr[k][1]]);
		vs[k]=Matrix(vs[tr[k][1]])*vs[tr[k][0]];
	}
}
void dfs3(int k){
	if(!tr[k][0]){
		ds::fa[build(hd[k],k)]=fa[hd[k]];
	}else{
		dfs3(tr[k][0]);
		dfs3(tr[k][1]);
	}
}
signed main(){
	ds::init();
	read(n);
	read(q);
	char opt;
	for(int i=1;i<=n;i++){
		scanf(" %c",&opt);
		if(opt=='x'){
			read(tr[i][0]);
			read(tr[i][1]);
		}else if(opt=='v'){
			read(vs[i][0]);
			read(vs[i][1]);
			read(vs[i][2]);
		}
	}
	dfs(1,0);
	dfs2(1,0);
	dfs3(1);
//	ds::show();
//	Vector cur=ds::query(1);
//	printf("%lld %lld %lld\n",cur[0]*ext%md,cur[1]*ext%md,cur[2]*ext%md);
	int pos;
	for(int i=1;i<=q;i++){
		read(pos);
		read(vs[pos][0]);
		read(vs[pos][1]);
		read(vs[pos][2]);
		ds::update(pos);
		Vector cur=ds::query(1);
		printf("%lld %lld %lld\n",cur[0]*ext%md,cur[1]*ext%md,cur[2]*ext%md);
	}
	return 0;
}