#include <bits/stdc++.h>
#define lc (u << 1)
#define rc (u << 1 | 1)
const int N = 1e5 + 10;
int n, m, root, mod;
int cnt, a[N], hs[N], sz[N], dep[N], fa[N], ll[N], rr[N], idx[N], top[N];
//节点数、点权、重儿子编号、大小、深度、父节点、 子树区间[ll, rr],dfs序编号、链头元素
long long sum[N * 4], tag[N * 4];
std::vector<int>e[N];
void dfs1(int u, int f) {
    sz[u] = 1;
    hs[u] = -1;
    dep[u] = dep[f] + 1;
    for(int v : e[u]) {
        if(v == f) continue;
        fa[v] = u;
        dfs1(v, u);
        sz[u] += sz[v];
        if(hs[u] == -1 || sz[v] > sz[hs[u]]) hs[u] = v;
    }
}
void dfs2(int u, int t) {
    top[u] = t;
    ll[u] = ++cnt;
    idx[cnt] = u;
    if(hs[u] != -1) {
        dfs2(hs[u], t);
    }
    for(int v : e[u]) {
        if(v == fa[u] || v == hs[u]) continue;
        dfs2(v, v);
    }
    rr[u] = cnt;
}
void build(int u, int l, int r) {
    if(l == r) {
        sum[u] = a[idx[l]];
        return;
    }
    int mid = (l + r) >> 1;
    build(lc, l, mid);
    build(rc, mid + 1, r);
    sum[u] = (sum[lc] + sum[rc]) % mod;
}
void pushdown(int u) {
    if(tag[u]) {
        sum[lc] = (sum[lc] + tag[u]) % mod;
        sum[rc] = (sum[rc] + tag[u]) % mod;
        tag[lc] = (tag[lc] + tag[u]) % mod;
        tag[rc] = (tag[rc] + tag[u]) % mod;
        tag[u] = 0;
    }
}
void modify(int u, int l, int r, int ql, int qr, int x) {
    if(l == ql && r == qr) {
        sum[u] = (sum[u] + x) % mod;
        tag[u] = (tag[u] + x) % mod;
        return;
    }
    pushdown(u);
    int mid = (l + r) >> 1;
    if(qr <= mid) modify(lc, l, mid, ql, qr, x);
    else if(ql > mid) modify(rc, mid + 1, r, ql, qr, x);
    else {
        modify(lc, l, mid, ql, mid, x);
        modify(rc, mid + 1, r, mid + 1, qr, x);
    }
    sum[u] = (sum[lc] + sum[rc]) % mod;
}
long long query(int u, int l, int r, int ql, int qr) {
    if(l == ql && r == qr) {
        return sum[u] % mod;
    }
    pushdown(u);
    int mid = (l + r) >> 1;
    if(qr <= mid) return query(lc, l, mid, ql, qr);
    else if(ql > mid) return query(rc, mid + 1, r, ql, qr);
    return (query(lc, l, mid, ql, mid) + query(rc, mid + 1, r, mid + 1, qr)) % mod;
}
void modify(int u, int v, int x)  {
    while(top[u] != top[v]) {
        if(dep[top[u]] < dep[top[v]]) {
            modify(1, 1, n, ll[top[v]], ll[v], x);
            v = fa[top[v]];
        }
        else {
            modify(1, 1, n, ll[top[u]], ll[u], x);
            u = fa[top[u]];
        }
    }
    if (dep[u] <= dep[v]) modify(1, 1, n, ll[u], ll[v], x);
    else modify(1, 1, n, ll[v], ll[u], x);
}
long long query(int u, int v) {
    long long ans = 0;
    while(top[u] != top[v]) {
        if(dep[top[u]] < dep[top[v]]) {
            ans = (ans + query(1, 1, n, ll[top[v]], ll[v])) % mod;
            v = fa[top[v]];
        }
        else {
            ans = (ans + query(1, 1, n, ll[top[u]], ll[u])) % mod;
            u = fa[top[u]];
        }
    }
    if (dep[u] <= dep[v]) ans = (ans + query(1, 1, n, ll[u], ll[v])) % mod;
    else ans = (ans + query(1, 1, n, ll[v], ll[u])) % mod;
    return ans ;
}
signed main() {
    std:: cin >> n >> m >> root >> mod;
    for(int i = 1; i <= n; i++) std:: cin >> a[i];
    for(int i = 1; i <= n - 1; i++) {
        int u, v; std:: cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs1(root, 0);
    dfs2(root, root);
    build(1, 1, n);
    while(m--) {
        int tp; std:: cin >> tp;
        if(tp == 1){
            int u, v, x; std:: cin >> u >> v >> x;
            modify(u, v, x);
        }
        else if(tp == 2) {
            int u, v; std:: cin >> u >> v;
            std:: cout << query(u, v) % mod << '\n';
        }
        else if(tp == 3) {
            int x, y; std:: cin >> x >> y;
            modify(1, 1, n, ll[x], rr[x], y);
        }
        else {
            int x; std:: cin >> x;
            std:: cout << query(1, 1, n, ll[x], rr[x]) % mod<< '\n';
        }
    }
}