#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define il inline
using namespace std;
const int N=100005;
int n,m,r,p;
int w[N];//点权 
int son[N],siz[N],dep[N],fa[N],dfn[N],rnk[N],top[N],tot;
struct edge{
    int nxt;
    int to;
}edge[N<<1];
int head[N],cnt;
void addedge(int u,int v){
    edge[++cnt].to=v,edge[cnt].nxt=head[u],head[u]=cnt;
}
struct SegTree{
    int sum[N<<2],lazy[N<<2];
    int lc(int x){return x<<1;}
    int rc(int x){return x<<1|1;}
    void push_up(int rt){
        sum[rt]=sum[lc(rt)]+sum[rc(rt)];
        sum[rt]%=p;
    }
    void push_down(int rt,int llen,int rlen){
        if(lazy[rt]){
            lazy[lc(rt)]+=lazy[rt];
            lazy[rc(rt)]+=lazy[rt];
            lazy[lc(rt)]+=lazy[rt]*llen;
            lazy[rc(rt)]+=lazy[rt]*rlen;
            lazy[lc(rt)]%=p;
            lazy[rc(rt)]%=p;
        }
        lazy[rt]=0;
    }
    void build(int rt,int l,int r){
        lazy[rt]=0;
        if(l==r){
            sum[rt]=w[rnk[l]];
            sum[rt]%=p;
            return;
        }
        int mid=(l+r)>>1;
        build(lc(rt),l,mid);
        build(rc(rt),mid+1,r);
        push_up(rt);
    }
    void update(int rt,int l,int r,int L,int R,int val){
        if(L<=l&&r<=R){
            sum[rt]+=val*(r-l+1);
            lazy[rt]+=val;
            return;
        }
        push_down(rt,m-l+1,r-m);
        int mid=(l+r)>>1;
        if(L<=mid) update(lc(rt),l,mid,L,R,val);
        if(R>mid) update(rc(rt),mid+1,r,L,R,val);
        push_up(rt); 
    }
    int query(int rt,int l,int r,int L,int R){
        if(L<=l&&r<=R){
            return sum[rt]%p;
        }
        int mid=(l+r)>>1;
        push_down(rt,mid-l+1,r-mid);
        int ans=0;
        if(L<=mid){ans+=query(lc(rt),l,mid,L,R)%p;ans%=p;}
        if(R>mid){ans+=query(rc(rt),mid+1,r,L,R)%p;ans%=p;}
        return ans%p;
    }
}SegT;
void dfs1(int u){
    son[u]=-1;
    siz[u]=1;
    for(int i=head[u];i;i=edge[i].nxt){
        int to=edge[i].to;
        if(!dep[to]){
            dep[to]=dep[u]+1;
            fa[to]=u;
            dfs1(to);
            siz[u]+=siz[to];
            if(son[u]==-1||siz[to]>siz[son[u]]) son[u]=to;
        }
    }
}
void dfs2(int u,int tp){
    top[u]=tp;
    tot++;
    dfn[u]=tot;
    rnk[tot]=u;
    if(son[u]==-1) return;
    dfs2(son[u],tp);
    for(int i=head[u];i;i=edge[i].nxt){
        int to=edge[i].to;
        if(to!=son[u]&&to!=fa[u]) dfs2(to,to);
    }
}
int queryPath(int x,int y){
    int ans=0;
    while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        ans+=SegT.query(1,1,n,dfn[top[x]],dfn[x])%p;
        ans%=p;
        x=fa[top[x]];
    }
    if(dfn[x]>dfn[y]) swap(x,y);
    ans+=SegT.query(1,1,n,dfn[x],dfn[y])%p;
    ans%=p;
    return ans%p;
}
void updatePath(int x,int y,int val){
    val%=p;
    while(top[x]!=top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        SegT.update(1,1,n,dfn[top[x]],dfn[x],val);
        x=fa[top[x]];
    }
    if(dfn[x]>dfn[y]) swap(x,y);
    SegT.update(1,1,n,dfn[x],dfn[y],val);
}
int querySon(int x){
    return SegT.query(1,1,n,dfn[x],dfn[x]+siz[x]-1)%p;
}
void updateSon(int x,int val){
    val%=p;
    SegT.update(1,1,n,dfn[x],dfn[x]+siz[x]-1,val);
}
int main(){
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    scanf("%d%d%d%d",&n,&m,&r,&p);
    for(int i=1;i<=n;i++) scanf("%d",&w[i]);
    for(int i=1;i<n;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        addedge(u,v);
        addedge(v,u);
    }
    dep[r]=1;
    dfs1(r);
    dfs2(r,r);
    for(int i=1;i<=m;i++){
        int opt;
        scanf("%d",&opt);
        if(opt==1){
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            updatePath(x,y,z);
        }
        else if(opt==2){
            int x,y;
            scanf("%d%d",&x,&y);
            printf("%d\n",queryPath(x,y));
        }
        else if(opt==3){
            int x,y;
            scanf("%d%d",&x,&y);
            updateSon(x,y);
        }
        else{
            int x;
            scanf("%d",&x);
            printf("%d\n",querySon(x));
        }
    }
    return 0;
}

全WA