#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #define N 100010

 typedef long long ll;

 using namespace std;

 int ecnt,head[N],son[N],fa[N],sz[N],n,m,r,deep[N],pos[N],indx[N],tot,op,back[N],top[N];

 ll val[N],P;

 struct adj

 {

     int nxt,v;

 }e[*N];

 struct node

 {

     int l,r;

     ll sum,lz;

 }t[*N];

 void add(int u,int v)

 {

     e[++ecnt].v=v;

     e[ecnt].nxt=head[u];

     head[u]=ecnt;

     e[++ecnt].v=u;

     e[ecnt].nxt=head[v];

     head[v]=ecnt;

 }

 void dfs1(int x,int father,int dep)

 {

     deep[x]=dep,fa[x]=father,sz[x]=;

     for (int i=head[x];i;i=e[i].nxt)

     {

     int v=e[i].v;

     if (fa[x]==v) continue;

     dfs1(v,x,dep+);

     sz[x]+=sz[v];

     if (sz[v]>sz[son[x]]) son[x]=v;

     }

 }

 void dfs2(int x,int TOP)

 {

     top[x]=TOP;

     pos[x]=++tot;

     indx[tot]=x;

     if (son[x]) dfs2(son[x],TOP);

     for (int i=head[x];i;i=e[i].nxt)

     {

     int v=e[i].v;

     if (v==fa[x] || v==son[x]) continue;

     dfs2(v,v);

     }

     back[x]=tot;

 }

 void pushdown(int p)

 {

     if (t[p].l==t[p].r || !t[p].lz) return;

     int w=t[p].lz;

     t[p<<].sum=(t[p<<].sum+w*(t[p<<].r-t[p].l+)%P)%P;

     t[p<<|].sum=(t[p<<|].sum+w*(t[p<<|].r-t[p<<|].l+)%P)%P;

     t[p<<].lz+=w;

     t[p<<].lz%=P;

     t[p<<|].lz+=w;

     t[p<<|].lz%=P;

     t[p].lz=;

 }

 void pushup(int p)

 {

     t[p].sum=(t[p<<].sum+t[p<<|].sum)%P;

 }

 void build(int p,int l,int r)

 {

     t[p].l=l,t[p].r=r,t[p].lz=;

     if (l!=r)

     {

     int mid=l+r>>;

     build(p<<,l,mid);

     build(p<<|,mid+,r);

     pushup(p);

     }

     else

     t[p].sum=val[indx[l]]%P;

 }

 void modify(int p,int l,int r,int w)

 {

     if (t[p].l==l && t[p].r==r)

     {

     t[p].sum+=w*(t[p].r-t[p].l+);

     t[p].lz+=w;

     return ;

     }

     pushdown(p);

     int mid=t[p].l+t[p].r>>;

     if (r<=mid) modify(p<<,l,r,w);

     else if (l>mid) modify(p<<|,l,r,w);

     else modify(p<<,l,mid,w),modify(p<<|,mid+,r,w);

     pushup(p);

 }

 ll query(int p,int l,int r)

 {

     if (t[p].l==l && t[p].r==r)

     return t[p].sum%P;

     int mid=t[p].l+t[p].r>>;

     pushdown(p);

     if (r<=mid) return query(p<<,l,r)%P;

     if (l>mid) return query(p<<|,l,r)%P;

     return (query(p<<,l,mid)+query(p<<|,mid+,r))%P;

 }

 void pathInc(int u,int v,int w)

 {

     while (top[u]!=top[v])

     {

     if (deep[top[u]]<deep[top[v]]) swap(u,v);

     modify(,pos[top[u]],pos[u],w);

     u=fa[top[u]];

     }

     if (deep[u]>deep[v]) swap(u,v);

     modify(,pos[u],pos[v],w);

 }

 ll pathQuery(int u,int v)

 {

     ll ret=;

     while (top[u]!=top[v])

     {

     if (deep[top[u]]<deep[top[v]]) swap(u,v);

     ret=(ret+query(,pos[top[u]],pos[u]))%P;

     u=fa[top[u]];

     }

     if (deep[u]>deep[v]) swap(u,v);

     return (ret+query(,pos[u],pos[v]))%P;

 }

 int main()

 {

     scanf("%d%d%d%lld",&n,&m,&r,&P);

     for (int i=;i<=n;i++)

     scanf("%lld",&val[i]);

     for (int i=,u,v;i<n;i++)

     scanf("%d%d",&u,&v),add(u,v);

     dfs1(r,,);

     dfs2(r,r);

     build(,,n);

     for (int i=,x,y,z;i<=m;i++)

     {

     scanf("%d",&op);

     if (op==)

         scanf("%d%d%d",&x,&y,&z),pathInc(x,y,z);

     else if (op==)

         scanf("%d%d",&x,&y),printf("%lld\n",pathQuery(x,y));

     else if (op==)

         scanf("%d%d",&x,&z),modify(,pos[x],back[x],z);

     else scanf("%d",&x),printf("%lld\n",query(,pos[x],back[x]));

     }

     return ;

 }