// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first
#define se second
const int inf=1e18;
int mod;
const int maxn=250005;
const int bl=650;
const int maxs=405;
const int maxm=250005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;n>>=1;
}
return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
void solve(){
int n;cin >> n >> mod;
vector<vector<int>> edge(n+1),mul(n+1,vector<int>(41,1));
vector<int> h(n+1),par(n+1);
for(int i=1;i<n;i++){
int u,v;cin >> u >> v;
edge[u].push_back(v);
edge[v].push_back(u);
}
for(int i=1;i<=n;i++) cin >> h[i];
function<void(int,int)> dfs = [&](int u,int p){
par[u]=p;
for(int v:edge[u]){
if(v==p) continue;
dfs(v,u);
}
};
dfs(1,0);
int q;cin >> q;
while(q--){
int id,x,d,k;cin >> id >> x;
if(id==1){
cin >> d >> k;
while(d && x>1){
mul[x][d]=mul[x][d]*k%mod;
mul[x][d-1]=mul[x][d-1]*k%mod;
x=par[x];d--;
}
for(int i=d;i>=0;i--) mul[x][i]=mul[x][i]*k%mod;
}
else{
int res=h[x];
for(int i=0;i<=40;i++){
res=res*mul[x][i]%mod;
x=par[x];
}
cout << res << '\n';
}
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int test=1;//cin >> test;
while(test--) solve();
}
