/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 2e5 + 5;
int n, mod, q, h[MAXN], parent[MAXN], lazy[MAXN][45];
vector<int> adj[MAXN];
void init() {
cin >> n >> mod;
for (int i = 1; i < n; ++i) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for (int i = 1; i <= n; ++i) cin >> h[i];
for (int i = 1; i <= n; ++i)
for (int j = 0; j <= 40; ++j)
lazy[i][j] = 1;
}
void dfs(int u, int par = 0) {
parent[u] = par;
for (int v : adj[u])
if (v != par) dfs(v, u);
}
void solve() {
dfs(1);
cin >> q;
while (q--) {
int type, x; cin >> type >> x;
if (type == 1) {
int d, w; cin >> d >> w;
int cur = x;
while (cur != 0 && d >= 0) {
if (cur != 1 && d > 0) {
lazy[cur][d] = 1ll * lazy[cur][d] * w % mod;
lazy[cur][d - 1] = 1ll * lazy[cur][d - 1] * w % mod;
} else {
for (int j = 0; j <= d; ++j)
lazy[cur][j] = 1ll * lazy[cur][j] * w % mod;
}
cur = parent[cur];
--d;
}
} else {
int cur_d = 0, res = h[x];
int cur = x;
while (cur > 0 && cur_d <= 40) {
res = 1ll * res * lazy[cur][cur_d] % mod;
++cur_d; cur = parent[cur];
}
cout << res << '\n';
}
}
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
