#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
/*
                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
 */                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
                                
                int pr[1000010];
                int inv[1000010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
                	
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
    
                                     //----------------kokomade tenpure------------

vector<int> G[100020],G2[100020];
int cont=0;
int sz[100020];
int in[100020];
int rin[100020];
int nxt[100020];
int out[100020];
void dfs_sz(int v){
    sz[v]=1;
    for(auto &u :G2[v]){
        dfs_sz(u);
        sz[v]+=sz[u];
        if(sz[u]>sz[G2[v][0]])swap(u,G2[v][0]);
    }
}
void dfs_hld(int v){
    if(v==1) nxt[v]=1;
    in[v]=cont;
    cont++;
    rin[in[v]]=v;
    for(auto u:G2[v]){
        if(u==G2[v][0])nxt[u]=nxt[v];
        else nxt[u]=u;
        dfs_hld(u);
    }
    out[v]=cont;
}
// vのsubtreeに含まれる区間は[in[v],out[v])
// vを含むheavy列の一番上はnxt[v]
// heavy列で[in[nxt[v]],...,in[v]]に一様操作すればOK
 
 using A=array<int,4>;
A uni={1,0,0,1};

A merge(A m1,A m2){
	A t;
	t[0]=(m1[0]*m2[0]+m1[1]*m2[2])%inf;
	t[1]=(m1[0]*m2[1]+m1[1]*m2[3])%inf;
	t[2]=(m1[2]*m2[0]+m1[3]*m2[2])%inf;
	t[3]=(m1[2]*m2[1]+m1[3]*m2[3])%inf;
	return t;
}
struct segsum{
	//       1
	//   2        3
	// 4   5   6    7
	
	
	private:
	public:
	
	// (1<<15)=32768
	// 1<<16 = 65536
	// 1<<17 = 131072
	// 1<<18 = 262144
	
	int cor=(1<<17);
	
	vector<A> vec;
	
	void shoki1(){
		vec.resize(2*cor+3, uni);
	}
		void shoki2(){
			for(int i=cor-1;i>0;i--) vec[i]=merge(vec[2*i],vec[2*i+1]);
		}
			
	void updchan(int x,A w){
		//x項目をwに変更
		x+=cor;
		vec[x]=w;
		while(1){
			x/=2;
			if(x==0) break;
			vec[x]=merge(vec[2*x],vec[2*x+1]);
		}
		
	}
	// [a,b)
	// k-th node
	// k no kukanha [l,r)
	A sum(int a,int b,int k=1,int l=0,int r=-10){
		if(r<0)r=cor;
		
	//	cout<<a<<" "<<b<<" "<<k<<" "<<l<<" "<<r<<endl;
		
		if(a<=l && r<=b){
			return vec[k];
		}
		if(r<=a || b<=l){
			return uni;
		}
		
		A v1=sum(a,b,k*2,l,(l+r)/2),v2=sum(a,b,k*2+1,(l+r)/2,r);
		return merge(v1,v2);
	}
	
};
segsum SE;
int depth[100020];
int oya[100020][20];
void fdsf(int r,int p,int d){
	depth[r]=d;
	oya[r][0]=p;
	for(auto v:G[r])if(v!=p){
		G2[r].pb(v);
		fdsf(v,r,d+1);
	}
}


A solve(int e,int r){
//	cout<<"sol"<<r<<endl;
	int sita=r;
	A ans=uni;
	while(1){
//		cout<<sita<<" "<<endl;
		int ue=nxt[sita];
		if(ue==nxt[e]){
		
			return merge(SE.sum(in[e],in[sita]+1),ans);
		}
		ans=merge(SE.sum(in[ue],in[sita]+1),ans);
	//	cout<<"ue "<<ue<<" "<<sita<<" "<<SE.getsum(in[ue],in[sita]+1)<<endl;
		
	//	cout<<"sita "<<sita<<" "<<ue<<endl;
	//	for(int i=0;i<4;i++)cout<<ans[i]<<" ";
	//	cout<<endl;
		sita=oya[ue][0];
		
	}
}
int hen[100020][2];
 signed main(){

    	       cin.tie(0);
   			ios::sync_with_stdio(false);
 	int n;
 	cin>>n;

 	oya[1][0]=1;
 	for(int i=1;i<n;i++){
 		int y,yy;
 		cin>>y>>yy;
 		y++;
 		yy++;
 		hen[i][0]=y;
 		hen[i][1]=yy;
 		G[y].pb(yy);
 		G[yy].pb(y);
 	}
 	
 	fdsf(1,1,0);
 	
 	for(int d=1;d<20;d++)for(int i=1;i<=n;i++){
 		oya[i][d]=oya[oya[i][d-1]][d-1];
 	}
 	
 	dfs_sz(1);
 	dfs_hld(1);
 //	for(int i=1;i<=n;i++)cout<<in[i]<<" ";
//	cout<<endl;
 	SE.shoki1();
 
 	SE.shoki2();
 	
 	int q;
 	cin>>q;
 
 	for(int er=0;er<q;er++){
 		string t;
 //		cout<<"que "<<er<<endl;
 		cin>>t;
 		if(t=="x"){
 		A e;
 			int pos;
 			cin>>pos;
 			pos++;
 			if(oya[hen[pos][0]][0]==hen[pos][1]) pos=hen[pos][0];
 			else pos=hen[pos][1];
 			for(int i=0;i<4;i++)cin>>e[i];
 //			for(int i=0;i<4;i++)cout<<e[i]<<" ";
 //			cout<<endl;
 //			cout<<in[pos]<<endl;
 			SE.updchan(in[pos],e);
 		}
 		else{
 			int x,y;
 			cin>>x>>y;
 			x++;
 			y++;
 			int sa=depth[y]-depth[x];
 			int ima=y;
 			for(int i=19;i>=0;i--)if(sa>(1<<i)){
 				sa-=(1<<i);
 				ima=oya[ima][i];
 			}
 		//	cout<<y<<" "<<ima<<endl;
 			A ans=solve(ima,y);
 			cout<<ans[0]<<" "<<ans[1]<<" "<<ans[2]<<" "<<ans[3]<<endl;
 		}
 		A z=SE.sum(0,n);
 //		for(int i=0;i<4;i++)cout<<z[i]<<" ";
 //		cout<<endl;
 	}
 	return 0;
  }