#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, l;
cin >> n >> l;
vector<vector<int>> adj(n + 1);
for (int i = 0, u, v; i < n - 1; ++i) {
cin >> u >> v;
adj[u].push_back(v), adj[v].push_back(u);
}
vector<int64_t> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int q;
cin >> q;
while (q--) {
int t;
cin >> t;
if (t == 1) {
int x, d, w;
cin >> x >> d >> w;
queue<int> q;
q.push(x);
vector<int> dist(n + 1, int(1e9));
dist[x] = 0;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int &i : adj[u]) {
if (dist[u] + 1 < dist[i]) {
dist[i] = dist[u] + 1;
q.push(i);
}
}
}
for (int i = 1; i <= n; ++i) {
if (dist[i] <= d) {
a[i] = (a[i] * w) % l;
}
}
} else {
int x;
cin >> x;
cout << a[x] << '\n';
}
}
}
