#include <bits/stdc++.h>
using namespace std;
#define int long long
int dis[200005], h[200005];
vector<int> adjl[200005];
int n, l, a, b;
int kali(int a, int b) {
return ((a%l)*(b%l))%l;
}
void bfs(int start, int d, int w) {
queue<int> q;
memset(dis, -1, sizeof(dis));
q.push(start);
dis[start] = 0;
h[start] = kali(h[start], w);
while (!q.empty()) {
int cur = q.front();
q.pop();
for (auto i: adjl[cur]) {
if (dis[i] == -1) {
dis[i] = dis[cur]+1;
if (dis[i] <= d) {
h[i] = kali(h[i], w);
if (dis[i] < d) {
q.push(i);
}
}
}
}
}
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> l;
for (int i = 1; i < n; i++) {
cin >> a >> b;
adjl[a].push_back(b);
adjl[b].push_back(a);
}
for (int i = 1; i <= n; i++) cin >> h[i];
int q, t, x, d, w;
cin >> q;
while (q--) {
cin >> t;
if (t == 1) {
cin >> x >> d >> w;
if (d == 0) h[x] = kali(h[x], w);
else if (d == 1) {
h[x] = kali(h[x], w);
for (auto i: adjl[x]) h[i] = kali(h[i], w);
}
else bfs(x, d, w);
}
else if (t == 2) {
cin >> x;
cout << h[x]%l << endl;
}
}
}
