#include <bits/stdc++.h>
using namespace std;
# define int long long
# define fir first
# define sec second
# define pb push_back
# define endl "\n"
const int cnst = 2e5+5;
bool mutipletestcase = 0;
//bool debug = false;
int F[cnst];
int inv[cnst];
int A(int a, int b, int mod) {return ((a%mod)+(b%mod)%mod);}
int S(int a, int b, int mod) {return ((a%mod)-(b%mod)+mod)%mod;}
int M(int a, int b, int mod) {return ((a%mod)*(b%mod)%mod);}
int E(int b, int p, int mod) {
if(!p) return 1;
return (p%2 ? M(E(M(b, b, mod), p/2, mod), b, mod) : E(M(b, b, mod), p/2, mod));
}
int C(int n, int r, int mod) {return M(M(F[n], inv[n-r], mod), inv[r], mod);}
void prefac(int maxn, int mod) {
F[0] = 1;
for(int i = 1; i<=maxn; i++) F[i] = M(F[i-1], i, mod);
inv[maxn] = E(F[maxn], mod-2, mod);
for(int i = maxn-1; i>=0; i--) inv[i] = M(inv[i+1], i+1, mod);
}
int gcd(int a, int b) {return b ? gcd(b, a%b): a;}
int lcm(int a, int b) {return a/gcd(a, b)*b;}
int par[cnst];
int val[cnst];
vector<int> vec[cnst];
void dfs(int x) {
for(auto v: vec[x]) {
if(v == par[x]) continue;
par[v] = x;
dfs(v);
}
}
void solve() {
int n, l; cin >> n >> l;
for(int i = 1; i<n; i++) {
int a, b; cin >> a >> b;
vec[a].pb(b);
vec[b].pb(a);
}
for(int i = 1; i<=n; i++) cin >> val[i];
int q; cin >> q;
bool yes = 1;
bool yes2 = 1;
tuple<int, int, int, int> quer[q+5];
for(int i = 1; i<=q; i++) {
int id; cin >> id;
int a, b = -1, c = -1;
if(id == 1) cin >> a >> b >> c;
else cin >> a;
quer[i] = {id, a, b, c};
if(id == 1 && b > 1) yes = 0;
if(id == 1 && c != 0) yes2 = 0;
}
// if(yes) {
// for(int i = 1; i<=q; i++) {
// auto[a, x, d, k] = quer[i];
// if(a == 1) {
// val[x] = M(val[x], k, l);
// if(d == 0) continue;
// for(auto v: vec[x]) val[v] = M(val[v], k, l);
// }
// else cout << val[x] << endl;
// }
// }
if(yes2) {
int max[n+5];
memset(max, 0, sizeof(max));
for(int i = 1; i<=q; i++) {
auto[a, x, d, k] = quer[i];
if(a == 2) {
cout << val[x] << endl;
continue;
}
else if(max[x] >= d) continue;
queue<pair<int, int>> q;
// bool vis[n+5];
// memset(vis, 0, sizeof(vis));
q.push({x, d}); max[x] = d;
while(!q.empty()) {
auto[a, dis] = q.front(); q.pop();
val[a] = M(val[a], k, l);
if(dis == 0) continue;
for(auto v: vec[a]) {
if(max[v] < dis) {
max[v] = dis;
q.push({v, dis-1});
}
}
}
}
return;
}
for(int i = 1; i<=q; i++) {
auto[a, x, d, k] = quer[i];
if(a == 2) {
cout << val[x] << endl;
continue;
}
queue<pair<int, int>> q;
bool vis[n+5];
memset(vis, 0, sizeof(vis));
q.push({x, 0}); vis[x] = 1;
while(!q.empty()) {
auto[a, dis] = q.front(); q.pop();
val[a] = M(val[a], k, l);
if(dis == d) continue;
for(auto v: vec[a]) {
if(!vis[v]) {
vis[v] = 1;
q.push({v, dis+1});
}
}
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
int t = 1;
if(mutipletestcase) cin >> t;
while(t--) solve();
}
