#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 2000045
int numNode, lim, numQuery;
int label[MAX];
vector<int> G[MAX];
int F[44][MAX];
int pa[MAX];
void dfs(int u, int p = -1){
pa[u] = p;
for (int&v : G[u]) if(v ^ p){
dfs(v, u);
}
}
int mul(int a, int b){
return 1LL * a * b % lim;
}
void process(void){
cin >> numNode >> lim;
for (int i = 1; i < numNode; ++i){
int u, v; cin >> u >> v;
u += 41, v += 41;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
for (int i = 1; i <= 41; ++i){
G[i].emplace_back(i + 1);
G[i + 1].emplace_back(i);
}
memset(F, 1, sizeof F);
for (int i = 1; i <= numNode; ++i) cin >> label[i + 41];
dfs(1);
cin >> numQuery;
for (int qu = 1; qu <= numQuery; ++qu){
int cmd; cin >> cmd;
if(cmd == 1){
int node, d, w; cin >> node >> d >> w;
node += 41;
for (int i = d; i >= 0; --i){
F[i][node] = mul(F[i][node], w);
if(i > 0) F[i - 1][node] = mul(F[i - 1][node], w);
node = pa[node];
}
}
else{
int node; cin >> node;
node += 41;
int res = label[node];
for (int i = 0; i <= 41; ++i){
res = mul(res, F[i][node]);
node = pa[node];
}
cout << res << '\n';
}
}
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
// freopen(name".inp", "r", stdin);
// freopen(name".out", "w", stdout);
process();
return (0 ^ 0);
}
