#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MN = 2e5+5;
const int MD = 45;
const int LOG = 20;
int n, l, q;
vector<vector<int>> tree(MN);
vector<vector<pair<int, int>>> ancs(MN);
vector<vector<int>> mult(MN, vector<int>(MD, 1));
int up[MN][LOG], dep[MN], tin[MN], tout[MN], t = 0;
int h[MN], lastUpd[MN], par[MN], sub[MN], root;
int centPar[MN];
bool ok[MN];
void prec(int node, int p = 0) {
tin[node] = t++;
up[node][0] = p;
for (int i = 1; i < LOG; i++) {
up[node][i] = up[up[node][i-1]][i-1];
}
for (auto next: tree[node]) {
if (next == p) continue;
dep[next] = dep[node] + 1;
prec(next, node);
}
tout[node] = t++;
}
bool is_anc(int u, int v) {
return tin[u] <= tin[v] && tout[u] >= tout[v];
}
int get_lca(int u, int v) {
if (u == v) return u;
if (dep[u] < dep[v]) swap(u, v);
for (int i = LOG-1; i >= 0; i--) {
if (!is_anc(up[u][i], v)) u = up[u][i];
}
return up[u][0];
}
int get_dis(int u, int v) {
int lca = get_lca(u, v);
return dep[u] + dep[v] - 2 * dep[lca];
}
void get_subs(int node, int p = 0) {
if (ok[node]) return;
sub[node] = 1;
for (auto next: tree[node]) {
if (next == p) continue;
get_subs(next, node);
sub[node] += sub[next];
}
}
int get_centroid(int node, int sz, int prev = 0) {
for (auto next: tree[node]) {
if (ok[next] || next == prev) continue;
if (sub[next] * 2 >= sz) return get_centroid(next, sz, node);
}
return node;
}
int build_centroid(int curr, int prev = 0) {
get_subs(curr);
int cent = get_centroid(curr, sub[curr]);
ok[cent] = true;
ancs[cent].push_back({cent, 0});
for (auto [anc, foo]: ancs[prev]) {
ancs[cent].push_back({anc, get_dis(anc, cent)});
}
for (auto next: tree[cent]) {
if (ok[next]) continue;
int nextCent = build_centroid(next, cent);
centPar[nextCent] = cent;
}
return cent;
}
void update(int u, int maxDis, int w) {
for (auto [anc, dis]: ancs[u]) {
if (dis > maxDis) continue;
int remDis = min(MD-2, maxDis - dis);
for (int i = 0; i <= remDis; i++) {
mult[anc][i] = (mult[anc][i] * w) % l;
}
}
}
int get_val(int u) {
int fin = h[u];
for (auto [anc, dis]: ancs[u]) {
if (dis >= MD) continue;
fin = (fin * mult[anc][dis]) % l;
}
return fin;
}
void solve() {
cin >> n >> l;
for (int i = 1; i < n; i++) {
int u, v; cin >> u >> v;
tree[u].push_back(v);
tree[v].push_back(u);
}
for (int i = 1; i <= n; i++) cin >> h[i];
dep[1] = 0;
tout[0] = 4*n;
prec(1, 0);
root = build_centroid(1);
cin >> q;
while (q--) {
int t; cin >> t;
if (t == 1) {
int x, d, w; cin >> x >> d >> w;
update(x, d, w);
}
else {
int x; cin >> x;
int ans = get_val(x);
cout << ans << "\n";
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
