//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define N 200015
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int cnt[N][55],n,L,fa[N],h[N];
vector<int>g[N];
void dfs(int p,int lp){
fa[p]=lp;
for (auto i:g[p]){
if (i!=lp){
dfs(i,p);
}
}
}
signed main(){
fast
cin>>n>>L;
for (int i=1;i<n;i++){
int a,b; cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i=1;i<=n;i++){
cin>>h[i];
}
for (int i=0;i<=n;i++){
for (int j=0;j<=50;j++)
cnt[i][j]=1;
}
dfs(1,0);
int q; cin>>q;
while (q--){
int type,x,d,w; cin>>type;
if (type==1){
cin>>x>>d>>w;
for (int i=0;i<=d;i++){
cnt[x][d-i]=cnt[x][d-i]*w%L;
if (x==0) break;
x=fa[x];
}
}
else {
cin>>x;
int ans=h[x];
for (int i=0;i<=40;i++){
ans=(ans*cnt[x][i])%L;
ans=(ans*cnt[x][i+1])%L;
x=fa[x];
if (x==0){
for (int j=i+1;j<=41;j++)
ans=(ans*cnt[x][j])%L;
break;
}
}
cout<<ans<<'\n';
}
}
}
