#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
const int D = 41;
int n;
ll L;
vector<int> g[N];
ll h[N];
int par[N];
ll a[N][D];
void dfs(int u = 0, int p = 0) {
par[u] = p;
for (int v : g[u]) {
if (v != p) {
dfs(v, u);
}
}
}
void upd(int v, int d, int w) {
for (int i = 0; i <= d; ++i, v = par[v]) {
(a[v][d - i] *= w) %= L;
}
}
int get(int v) {
int res = 1;
for (int i = 0; i < D; ++i, v = par[v]) {
(res *= a[v][i]) %= L;
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> L;
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dfs(0, 0);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < D; ++j) {
a[i][j] = 1;
}
}
int q;
cin >> q;
while (q--) {
int t;
cin >> t;
if (t == 1) {
int x, d, w;
cin >> x >> d >> w;
--x;
upd(x, d, w);
upd(x, d - 1, w);
}
if (t == 2) {
int x;
cin >> x;
--x;
cout << h[x] * get(x) % L << "\n";
}
}
return 0;
}
