#include <cstdio>
#include <vector>
int md;
inline int mul(int a, int b) {
return (long long)a * b % md;
}
const int N = 200000;
const int LG = 18;
const int K = 500;
std::vector<int> g[N], list[N], t[N];
int q, n, dep[N], pr[LG][N], in[N], out[N], pos[N], h[N];
void dfs(int v) {
static int dt = 0;
in[v] = dt++;
pos[v] = list[dep[v]].size();
list[dep[v]].push_back(v);
for (int i = 0; i < (int)g[v].size(); ++i) if (g[v][i] != pr[0][v]) {
pr[0][g[v][i]] = v;
dep[g[v][i]] = dep[v] + 1;
dfs(g[v][i]);
}
out[v] = dt;
}
bool par(int u, int v) {
return in[u] <= in[v] && out[u] >= out[v];
}
int lca(int u, int v) {
if (par(u, v)) return u;
for (int i = LG - 1; i >= 0; --i) if (!par(pr[i][u], v)) u = pr[i][u];
return pr[0][u];
}
int f(int u, int v) {
return dep[u] + dep[v] - 2 * dep[lca(u, v)];
}
void update(std::vector<int> &t, int l, int r, int x) {
for (l += t.size() >> 1, r += t.size() >> 1; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
t[l] = mul(t[l], x);
++l;
}
if (r & 1) {
--r;
t[r] = mul(t[r], x);
}
}
}
int get(std::vector<int> &t, int i) {
int res = 1;
for (i += t.size() >> 1; i > 0; i >>= 1) res = mul(res, t[i]);
return res;
}
int main() {
scanf("%d%d", &n, &md);
for (int i = 1; i < n; ++i) {
int a, b;
scanf("%d%d", &a, &b);
g[a - 1].push_back(b - 1);
g[b - 1].push_back(a - 1);
}
dfs(0);
for (int j = 1; j < LG; ++j) for (int i = 0; i < n; ++i) pr[j][i] = pr[j - 1][pr[j - 1][i]];
for (int i = 0; i < n; ++i) scanf("%d", h + i);
for (int i = 0; i < n; ++i) t[i].resize(list[i].size() << 1, 1);
scanf("%d", &q);
while (q--) {
int type, v;
scanf("%d%d", &type, &v);
--v;
if (type == 1) {
int dist, x;
scanf("%d%d", &dist, &x);
for (int i = dep[v] + dist; i >= dep[v] - dist; --i) {
int l = 0, r = list[i].size();
while (l < r) {
int m = l + r >> 1;
if (out[list[i][m]] >= out[v] || f(v, list[i][m]) <= dist) r = m;
else l = m + 1;
}
int fi = r;
l = 0, r = list[i].size();
while (l < r) {
int m = l + r >> 1;
if (out[list[i][m]] >= out[v] && f(v, list[i][m]) > dist) r = m;
else l = m + 1;
}
update(t[i], fi, r, x);
}
} else printf("%d\n", mul(h[v], get(t[dep[v]], pos[v])));
}
return 0;
}
