#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
if(p==0) return 1 % MOD;
long long r = bm(b, p >> 1);
if(p&1) return (((r*r) % MOD) * b) % MOD;
return (r*r) % MOD;
}
long long inv(long long b) {
return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) {
long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() {
for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
lucas[0] = 2;
lucas[1] = 1;
for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
fib[0] = 0;
fib[1] = 1;
for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
if(l > r) return 0;
if(l == 0) {
int s = r / (1ll << (k+1)); // number of complete cycles
int t = r % (1ll << (k+1));
int ans = s * (1ll << k);
ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
return ans;
}
else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
int n = a.size();
int bucket[n+1];
for(int i=1; i<=n; i++) bucket[i] = 1e18;
int ans = 1;
for(int x: a) {
auto it = lower_bound(bucket + 1, bucket +n +1, x);
int d = distance(bucket, it);
ans = max(ans, d);
bucket[d] = min(bucket[d], x);
}
return ans;
}
vector<int> adj[MAXN];
int par[MAXN];
int dep[MAXN];
void dfs(int node, int prv) {
par[node] = prv;
dep[node] = (prv== -1? 0: dep[prv]+1);
for(int x: adj[node]) if(x != prv) dfs(x, node);
}
void solve(int tc) {
int n, l;
cin >> n >> l;
for(int i=1; i<n; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(1, -1);
int h[n+1];
for(int i=1; i<=n; i++) cin >> h[i];
int dlt[n+1][41];
for(int i=1; i<=n; i++) for(int j=0; j<41; j++) dlt[i][j] = 1;
int q;
cin >> q;
while(q--) {
int t;
cin >> t;
if(t == 1) {
int x, d, w;
cin >> x >> d >> w;
vector<int> v;
for(int i=0; i<=d; i++) {
v.push_back(x);
x = par[x];
if(x == -1) break;
}
int maxdepthdone = -1;
for(int i=v.size()-1; i>=0; i--) {
int allow = d - i + dep[v[i]];
int mini = dep[v[i]];
for(int j = max(maxdepthdone + 1, mini); j <= allow; j++) {
dlt[v[i]][j - dep[v[i]]] = (dlt[v[i]][j - dep[v[i]]] * w) % l;
}
maxdepthdone = allow;
}
}
else {
int x;
cin >> x;
int cur = h[x];
for(int i=0; i<=40; i++) {
cur = (cur * dlt[x][i]) % l;
x = par[x];
if(x == -1) break;
}
cout << cur << "\n";
}
}
}
int32_t main() {
precomp();
ios::sync_with_stdio(0); cin.tie(0);
int t = 1; //cin >> t;
for(int i=1; i<=t; i++) solve(i);
}
