#include<bits/stdc++.h>
#define fi first
#define se second
#define mk make_pair
#define pub emplace_back
#define pob pop_back
using namespace std;
const int N=2e5+10;
typedef long long ll;
int n,mod;
ll dt[N][41];
vector<int> to[N];
int fa[N];
void dfs(int x){
	for(int y:to[x]){
		if(y==fa[x]) continue;
		fa[y]=x;
		dfs(y);
	}
}
int main(){
	//freopen("dd.in","r",stdin);
	ios::sync_with_stdio(false);
	cin>>n>>mod;
	for(int i=1;i<=n-1;i++){
		int x,y;cin>>x>>y;
		to[x].pub(y);to[y].pub(x);
	}
	for(int i=1;i<=n;i++){
		cin>>dt[i][0];
		for(int j=1;j<=40;j++) dt[i][j]=1;
	}
	dfs(1);
	int qs;cin>>qs;
	while(qs--){
		int tp;cin>>tp;
		if(tp==1){
			int x,d,w;
			cin>>x>>d>>w;
			while(d>=0){
			//	cout<<x<<" "<<d<<endl;
				dt[x][d]=dt[x][d]*w%mod;
				if(d==0) break;
				dt[x][d-1]=dt[x][d-1]*w%mod;
				d--;
				if(x==1){
					while(d>=0){
						dt[x][d]=dt[x][d]*w%mod;
						d--;
					}
					break;
				}
				x=fa[x];
			}
		}else{
			int x;
			cin>>x;
			ll ans=1;
			for(int d=0;d<=40&&x>0;d++){
				ans=ans*dt[x][d]%mod;
				x=fa[x];
			}
			cout<<ans<<endl;
		}
	}
	return 0;
}