#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
ll MOD = 1e9+7;
vi graph[200001];
ll oper[200061][42];
ll H[200001];
int up_vert[200061];
void dfs(int v, int pop)
{
up_vert[v] = pop;
forall(it,graph[v]) if(it != pop) dfs(it,v);
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n >> MOD;
rep2(i,1,n+60) rep2(k,0,40) oper[i][k] = 1;
rep(i,n-1)
{
int a,b;
cin >> a >> b;
graph[a].pb(b);
graph[b].pb(a);
}
rep2(i,1,n) cin >> H[i];
dfs(1,1);
up_vert[1] = n+1;
rep2(i,n+1,n+59) up_vert[i] = i+1;
int q;
cin >> q;
rep(qq,q)
{
int t;
cin >> t;
if(t == 1)
{
int x,d,w;
cin >> x >> d >> w;
int d2 = 0;
while(true)
{
if(d2 > d) break;
if(d-d2 >= 0) oper[x][d-d2] = (oper[x][d-d2]*w)%MOD;
if(d-d2-1 >= 0) oper[x][d-d2-1] = (oper[x][d-d2-1]*w)%MOD;
x = up_vert[x];
d2++;
}
}
else
{
int x;
cin >> x;
ll ans = H[x];
int d2 = 0;
while(d2 <= 40)
{
ans = (ans*oper[x][d2])%MOD;
x = up_vert[x];
d2++;
}
cout << ans << "\n";
}
}
}
