rt。

蒟蒻实在是调不出来了，请大佬们救救这个蒟蒻吧qwq

#include<cstdio>
#include<algorithm>
#define N 200010
#define Inf 2147483647
#define ll long long
#define int ll
using namespace std;
int read(){
	int d=0,f=1;char ch = getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')	f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){d = (d<<1)+(d<<3)+(ch^48);ch = getchar();}
	return d*f;
}
struct Edge{
	int v,nxt;
}edge[N<<2];
int head[N],cnt,Cnt;
int son[N],top[N],dep[N],id[N],fa[N],siz[N],w[N],wt[N],lazy[N<<3],tree[N<<3];
int n,m,r,mod;
inline void add(int u,int v){
	edge[++cnt].v=v;
	edge[cnt].nxt=head[u];
	head[u]=cnt;
}
void dfs1(int x,int f){
	fa[x]=f;siz[x]=1;dep[x]=dep[f]+1;
	for(int i=head[x];i;i=edge[i].nxt){
		int v=edge[i].v;
		if(v==f) continue;
		dfs1(v,x);siz[x]+=siz[v];
		if(siz[v]>siz[son[x]]) son[x]=v;
	}
}
void dfs2(int x,int topf){
	id[x]=++Cnt;
	top[x]=topf;
	wt[id[x]]=w[x];
	if(!son[x]) return ;
	dfs2(son[x],topf);
	for(int i=head[x];i;i=edge[i].nxt){
		int v=edge[i].v;
		if(v==fa[x]||v==son[x]) continue;
		dfs2(v,v);
	}
}
inline void pushup(int rt){tree[rt]=tree[rt<<1]+tree[rt<<1|1];tree[rt]%=mod;}
inline void pushdown(int rt,int l,int r){
	if(!lazy[rt]) return ;
	int mid=(l+r)>>1;
	lazy[rt<<1]+=lazy[rt];lazy[rt<<1|1]+=lazy[rt];
	tree[rt<<1]+=lazy[rt]*(mid-l+1);tree[rt<<1|1]+=lazy[rt]*(r-mid);
	lazy[rt]=0;
	tree[rt<<1]%=mod;tree[rt<<1|1]%=mod;
}
void build(int rt,int l,int r){
	if(l==r){tree[rt]=wt[l]%mod;lazy[rt]=0;return ;}
	int mid=(l+r)>>1;
	build(rt<<1,l,mid);
	build(rt<<1|1,mid+1,r);
	pushup(rt);
}
int query(int rt,int l,int r,int ql,int qr){
	if(ql<=l&&r<=qr) {return tree[rt]%mod;}
	int res=0,mid=(l+r)>>1;
	pushdown(rt,l,r);
	if(ql<=mid) res+=query(rt<<1,l,mid,ql,qr);
	if(qr>mid) res+=query(rt<<1|1,mid+1,r,ql,qr);
	return res;
}
void update(int rt,int l,int r,int ql,int qr,int k){
	if(ql<=l&&r<=qr) {lazy[rt]+=k;tree[rt]+=k*(r-l+1);lazy[rt]%=mod;tree[rt]%=mod;return ;}
	int mid=(l+r)>>1;
	pushdown(rt,l,r);
	if(ql<=mid) update(rt<<1,l,mid,ql,qr,k);
	if(qr>mid) update(rt<<1|1,mid+1,r,ql,qr,k);
	pushup(rt);
}
int qRange(int x,int y){
	int res=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		res+=query(1,1,n,id[top[x]],id[x]);
		x=fa[top[x]];res%mod;
	}
	if(dep[x]>dep[y]) swap(x,y);
	res+=query(1,1,n,id[x],id[y]);;
	return res%mod;
}
void upRange(int x,int y,int k){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		update(1,1,n,id[top[x]],id[x],k);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	update(1,1,n,id[x],id[y],k);
}
inline int qSon(int x){
	return query(1,1,n,id[x],id[x]+siz[x]-1);
}
inline void upSon(int x,int k){
	update(1,1,n,id[x],id[x]+siz[x]-1,k);
}
signed main(){
	n=read(),m=read(),r=read(),mod=read();
	for(int i=1;i<=n;i++) w[i]=read();
	for(int i=1;i<n;i++){
		int a=read(),b=read();
		add(a,b),add(b,a);
	}
	dfs1(r,0);
	dfs2(r,r);
	build(1,1,n);
	while(m--){
		int k=read();
		if(k==1){
			int x=read(),y=read(),z=read();
			upRange(x,y,z);
		}
		else if(k==2){
			int x=read(),y=read();
			printf("%d\n",qRange(x,y));
		}
		else if(k==3){
			int x=read(),y=read();
			upSon(x,y);
		}
		else{
			int x=read();
			printf("%d\n",qSon(x));
		}
	}
	return 0;
}