#include <bits/stdc++.h>
#define N 200005
#define mxD 43
using namespace std;
typedef long long ll;

int n, mod, Q, d[N], p[N];
vector <int> to[N];
ll f[N][mxD], val[N];

void dfs (int u, int fa)
{
    p[u]=fa; d[u]=d[fa]+1;
    for (int i=0; i<(int)to[u].size(); i++) {
        int v=to[u][i];
        if (v==fa) { continue; }
        dfs(v, u);
    }
}
inline void mul (ll &a, ll b) { a=a*b%mod; }

int main ()
{
    // freopen("0test.in", "r", stdin);
    // freopen("0test.out", "w", stdout);

    scanf("%d %d", &n, &mod);
    for (int i=1; i<n; i++) {
        int u, v; scanf("%d %d", &u, &v);
        to[u].push_back(v); to[v].push_back(u);
    }
    dfs(1, 0);
    for (int i=1; i<=n; i++) { scanf("%lld", &val[i]); }
    for (int i=1; i<=n; i++) {
        for (int j=0; j<=40; j++) { f[i][j]=1; }
    }
    
    scanf("%d", &Q);
    for (int t=1; t<=Q; t++) {
        int op; scanf("%d", &op);
        if (op==1) {
            int u, dst, num; scanf("%d %d %d", &u, &dst, &num);
            int v=u;
            while (v && d[u]-d[v]<=dst) {
                mul(f[v][dst-(d[u]-d[v])], num);
                if (d[u]-d[v]<dst) mul(f[v][dst-(d[u]-d[v])-1], num);
                if (v==1) {
                    for (int i=0; i<dst-(d[u]-d[v])-1; i++) { mul(f[v][i], num); }
                }
                v=p[v];
            }
        }
        else {
            int u; scanf("%d", &u);
            int v=u; ll ans=val[u];
            while (v && d[u]-d[v]<=40) { mul(ans, f[v][d[u]-d[v]]); v=p[v]; }
            printf("%lld\n", ans);
        }
    }

    return 0;
}