#include<iostream>
#include<cstdio>
#include<vector>
#define ls (p<<1)
#define rs (p<<1|1)
using namespace std;
int n,m,root,mod,u,v,tot,opt,x,y,z;
int a[100001],fa[100001],siz[100001],d[100001],son[100001];
int dfn[100001],w[100001],top[100001],tree[500001],tag[500001];
vector<int> g[100001];
void dfs1(int u){
	siz[u]=1;
	d[u]=d[fa[u]]+1;
	int sz=g[u].size();
	for(int i=0;i<sz;i++){
		int v=g[u][i];
		if(v==fa[u])continue;
		fa[v]=u;
		dfs1(v);
		siz[u]+=siz[v];
		if(siz[v]>siz[son[u]])son[u]=v;
	}
}
void dfs2(int u,int tp){
	dfn[u]=++tot;
	top[u]=tp;
	w[tot]=a[u]%mod;
	if(son[u]==0)return;
	dfs2(son[u],tp);
	int sz=g[u].size();
	for(int i=0;i<sz;i++){
		int v=g[u][i];
		if(v!=fa[u]&&v!=son[u])dfs2(v,v);
	}
}
void build(int p,int l,int r){
	if(l==r){
		tree[p]=w[l];
		return;
	}
	int mid=(l+r)>>1;
	build(ls,l,mid);
	build(rs,mid+1,r);
	tree[p]=(tree[ls]+tree[rs])%mod;
}
void pushdown(int p,int l,int r){
	if(tag[p]){
		int mid=(l+r)>>1;
		tag[ls]=(tag[ls]+tag[p])%mod;
		tag[rs]=(tag[rs]+tag[p])%mod;
		tree[ls]=(tree[ls]+(mid-l+1)*tag[p])%mod;
		tree[rs]=(tree[rs]+(r-mid)*tag[p])%mod;
		tag[p]=0;
	}
}
void add(int p,int l,int r,int x,int y,int z){
	if(x<=l&&r<=y){
		tag[p]=(tag[p]+z)%mod;
		tree[p]=(tree[p]+(r-l+1)*z)%mod;
		return;
	}
	pushdown(p,l,r);
	int mid=(l+r)>>1;
	if(x<=mid)add(ls,l,mid,x,y,z);
	if(mid<y) add(rs,mid+1,r,x,y,z);
	tree[p]=(tree[ls]+tree[rs])%mod;
}
void do1(int x,int y,int z){
	while(top[x]!=top[y]){
		if(d[top[x]]<d[top[y]])swap(x,y);
		add(1,1,n,dfn[top[x]],dfn[x],z);
		x=fa[top[x]];
	}
	if(d[x]>d[y])swap(x,y);
	add(1,1,n,dfn[x],dfn[y],z);
}
int query(int p,int l,int r,int x,int y){
	if(x<=l&&r<=y)return tree[p];
	pushdown(p,l,r);
	int mid=(l+r)>>1,ans=0;
	if(x<=mid)ans=query(ls,l,mid,x,y);
	if(mid<y)ans+=query(rs,mid+1,r,x,y);
	return ans%mod;
}
int do2(int x,int y){
	int ans=0;
	while(top[x]!=top[y]){
		if(d[top[x]]<d[top[y]])swap(x,y);
		ans=(ans+query(1,1,n,dfn[top[x]],dfn[x]))%mod;
		x=fa[top[x]];
	}
	if(d[x]>d[y])swap(x,y);
	return (ans+query(1,1,n,dfn[x],dfn[y]))%mod;
}
int main(){
	scanf("%d%d%d%d",&n,&m,&root,&mod);
	for(int i=1;i<=n;i++)scanf("%d",a+i);
	for(int i=1;i<n;i++){
		scanf("%d%d",&u,&v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs1(root);
	dfs2(root,root);
	build(1,1,n);
	while(m--){
		scanf("%d%d",&opt,&x);
		if(opt==1)scanf("%d%d",&y,&z),do1(x,y,z%mod);
		else if(opt==2)scanf("%d",&y),printf("%d\n",do2(x,y));
		else if(opt==3)scanf("%d",&z),add(1,1,n,dfn[x],dfn[x]+siz[x]-1,z);
		else printf("%d\n",query(1,1,n,dfn[x],dfn[x]+siz[x]-1));
	}
}