#include<iostream>
#include<stdio.h>
#include<stdint.h>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>
#include<stack>
using namespace std;
const int64_t INF = (int64_t) 1e18 + 777;
const int64_t mINF = 2500 + 5;
const int64_t MOD = 1e9 + 9;
const int nbit = 11;
const int ndig = 10;
const int nchar = 26;
const int p1 = 31;
const int p2 = 53;
const int D = 4;
int dr[D] = {0, 1, 0, -1};
int dc[D] = {1, 0, -1, 0};
struct Solution
{
int n;
int64_t l;
vector<int> h;
vector<vector<int> > adj;
Solution() {}
void solve()
{
cin >> n >> l;
adj.resize(n);
for(int i = 0; i < n - 1; i++)
{
int u;
int v;
cin >> u >> v;
u--; v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
h.resize(n);
for(int i = 0; i < n; i++)
{
cin >> h[i];
}
int q;
cin >> q;
for(int i = 0; i < q; i++)
{
int t;
cin >> t;
if(t == 1)
{
int u;
int d;
int64_t w;
cin >> u >> d >> w;
u--;
DFS(u, d, w);
}
else
{
int u;
cin >> u;
u--;
cout << h[u] << "\n";
}
}
}
void DFS(int u, int d, int w, int p = -1)
{
int64_t tmp = (1LL * h[u] * w) % l;
h[u] = tmp;
if(d == 0) return;
for(int i = 0; i < (int) adj[u].size(); i++)
{
int v = adj[u][i];
if(v == p) continue;
DFS(v, d - 1, w, u);
}
}
int modsub(int t1, int t2)
{
int res = t1 - t2;
if(res < 0) res += MOD;
return res;
}
int modadd(int t1, int t2)
{
int res = t1 + t2;
if(res >= MOD) res -= MOD;
return res;
}
int modmul(int t1, int t2)
{
int64_t res = 1LL * t1 * t2;
return (res % MOD);
}
bool BIT(int& mask, int& j)
{
return (mask & MASK(j));
}
int MASK(int j)
{
return (1 << j);
}
};
void __startup()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
}
int main()
{
__startup();
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
Solution().solve();
}
return 0;
}
