#include<bits/stdc++.h>
#define ll long long 
#define int long long 
using namespace std;
const int N=1e5+10;
const int inf=0x3f3f3f3f;
int n,m,sz[N],f[N],dep[N],son[N],top[N],Mod,rt;
int sum[N<<2],add[N<<2];
int a[N],w[N];
int dfn[N],dfntot;
int h[N],cnt;
struct node{
	int to,nxt;
}e[N<<3];
inline ll read(){
	ll s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-') w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){s=s*10+ch-'0';ch=getchar();}
	return s*w;
}
inline void adde(int u,int v){
	e[++cnt].nxt=h[u];
	e[cnt].to=v;
	h[u]=cnt;
}
inline void Add(int k,int l,int r,int v){add[k]=(add[k]+v)%Mod;sum[k]=(sum[k]+(r-l+1)*v%Mod)%Mod;}
inline void push_up(int k){sum[k]=(sum[k<<1]+sum[k<<1|1])%Mod;}
inline void push_down(int k,int l,int r,int mid){
	if(!add[k]) return ;
	Add(k<<1,l,mid,add[k]);
	Add(k<<1|1,mid+1,r,add[k]);
	add[k]=0;
}
inline void build(int k,int l,int r){
	if(l==r){
		sum[k]=a[l];
		return ;
	}
	int mid=(l+r)>>1;
	build(k<<1,l,mid);
	build(k<<1|1,mid+1,r);
	push_up(k);
}
inline ll query(int k,int l,int r,int x,int y){
	if(x<=l&&r<=y){return sum[k];}
	ll res=0;
	int mid=(l+r)>>1;
	push_down(k,l,r,mid);
	if(x<=mid) res=(res+query(k<<1,l,mid,x,y))%Mod;
	if(mid<y) res=(res+query(k<<1|1,mid+1,r,x,y))%Mod;
	return res%Mod;
}
inline void change(int k,int l,int r,int x,int y,int v){
	if(x<=l&&r<=y){Add(k,l,r,v);return;}
	int mid=(l+r)>>1;
	push_down(k,l,r,mid);
	if(x<=mid) change(k<<1,l,mid,x,y,v);
	if(mid<y) change(k<<1|1,mid+1,r,x,y,v);
	push_up(k);
}
inline void dfs1(int u,int fa,int depth){
	dep[u]=depth;sz[u]=1;f[u]=fa;
	int maxson=-1;
	for(int i=h[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(v==fa) continue;
		dfs1(v,u,depth+1);
		sz[u]+=sz[v];
		if(sz[v]>maxson) maxson=sz[v],son[u]=v;
	}
}
inline void dfs2(int u,int topf){
	dfn[u]=++dfntot;
	a[dfntot]=w[u];
	top[u]=topf;
	if(!son[u]) return;
	dfs2(son[u],topf);
	for(int i=h[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(v==f[u]||v==son[u]) continue;
		dfs2(v,v);
	}
}
inline ll qrange(int x,int y){
	ll res=0;
	while(top[x]!=top[y]){
		if(dep[x]<dep[y]) swap(x,y);
		res=(res+query(1,1,n,dfn[top[x]],dfn[x]))%Mod;
		x=f[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	res=(res+query(1,1,n,dfn[x],dfn[y]))%Mod;
	return res;
}
inline void crange(int x,int y,int v){
	v%=Mod;
	while(top[x]!=top[y]){
		if(dep[x]<dep[y]) swap(x,y);
		change(1,1,n,dfn[top[x]],dfn[x],v);
		x=f[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	change(1,1,n,dfn[x],dfn[y],v);
}
inline ll qson(int x){return query(1,1,n,dfn[x],dfn[x]+sz[x]-1);}
inline void cson(int x,int v){change(1,1,n,dfn[x],dfn[x]+sz[x]-1,v);}
signed main(){
	n=read();m=read();rt=read();Mod=read();
	for(int i=1;i<=n;i++) w[i]=read();
	int u,v;
	for(int i=1;i<n;i++){
		u=read();v=read();
		adde(u,v);adde(v,u);
	}
	dfs1(rt,0,1);
	dfs2(rt,rt);
	build(1,1,n);
	int op,x,y;
	while(m--){
		op=read();
		if(op==1){
			x=read();y=read();v=read();
			crange(x,y,v);
		} 
		if(op==2){
			x=read();y=read();
			printf("%d\n",qrange(x,y));
		}
		if(op==3){
			x=read();v=read();
			cson(x,v);
		}
		if(op==4){
			x=read();
			printf("%d\n",qson(x));
		}
	}
	return 0;
}