已经翻了半天讨论区了，还没解决，A3,11，还有8,9,10T了

#include <bits/stdc++.h>
using namespace std;
int n,m,r,p,id,ln;
int w[100005];
vector<int>vc[100005];
int fa[100005],son[100005],dep[100005],rid[100005],dfn[100005],rk[100005],top[100005],sz[100005];
int t[400005],lzt[400005];
void dfs1(int u,int f){
	dep[u]=dep[f]+1;
	fa[u]=f;
	sz[u]=1;
	int msz=0;
	for(int v:vc[u]){
		if(v==f)continue;
		dfs1(v,u);
		sz[u]+=sz[v];
		if(msz<sz[v])son[u]=v;
	}
}
void dfs2(int u,int f){
	dfn[u]=++id;
	rk[id]=u;
	if(u==son[f])top[u]=top[f];
	else top[u]=u;
	if(son[u]){
		dfs2(son[u],u);
		for(int v:vc[u]){
			if(v==f||v==son[u])continue;
			dfs2(v,u);
		}
	}
	rid[u]=id;
}
void add(int l,int r,int sl,int sr,int u,int val){
	if(l>=sl&&r<=sr){
		lzt[u]+=val;
		t[u]=t[u]+(r-l+1)*val;
		return;
	}
	int mid=(r+l-1)/2;
	if(lzt[u]&&l!=r){
		lzt[u*2]+=lzt[u],lzt[u*2]%=p;
		lzt[u*2+1]+=lzt[u],lzt[u*2+1]%=p;
		t[u*2]=t[u*2]+(mid-l+1)*lzt[u],t[u*2]%=p;
		t[u*2+1]=t[u*2+1]+(r-mid)*lzt[u],t[u*2+1]%=p;
		lzt[u]=0;
	}
	if(mid>=sl)add(l,mid,sl,sr,u*2,val);
	if(mid<sr)add(mid+1,r,sl,sr,u*2+1,val);
	t[u]=t[u*2]+t[u*2+1],t[u]%=p;
}
int getsum(int l,int r,int sl,int sr,int u){
	if(l>=sl&&r<=sr)return t[u];
	int mid=(r+l-1)/2;
	if(lzt[u]&&l!=r){
		lzt[u*2]+=lzt[u],lzt[u*2]%=p;
		lzt[u*2+1]+=lzt[u],lzt[u*2+1]%=p;
		t[u*2]=t[u*2]+(mid-l+1)*lzt[u],t[u*2]%=p;
		t[u*2+1]=t[u*2+1]+(r-mid)*lzt[u],t[u*2+1]%=p;
		lzt[u]=0;
	}
	int sum=0;
	if(mid>=sl)sum+=getsum(l,mid,sl,sr,u*2),sum%=p;
	if(mid<sr)sum+=getsum(mid+1,r,sl,sr,u*2+1),sum%=p;
	return sum;
}
int get(int x,int y){
	int sum=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]>dep[top[y]]){
			sum+=getsum(1,1<<ln,dfn[top[x]],dfn[x],1);
			x=fa[top[x]];
			sum%=p;
		}
		else{
			sum+=getsum(1,1<<ln,dfn[top[y]],dfn[y],1);
			y=fa[top[y]];
			sum%=p;
		}
	}
	sum+=getsum(1,1<<ln,min(dfn[x],dfn[y]),max(dfn[x],dfn[y]),1);
	return sum%p;
}
void upd(int x,int y,int z){
	while(top[x]!=top[y]){
		if(dep[top[x]]>dep[top[y]]){
			add(1,1<<ln,dfn[top[x]],dfn[x],1,z);
			x=fa[top[x]];
		}
		else{
			add(1,1<<ln,dfn[top[y]],dfn[y],1,z);
			y=fa[top[y]];
		}
	}
	add(1,1<<ln,min(dfn[y],dfn[x]),max(dfn[y],dfn[x]),1,z);
}
int main(){
	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);
		vc[u].push_back(v);
		vc[v].push_back(u);
	}
	dfs1(r,0);
	dfs2(r,0);
	for(int tn=n;tn/2;tn/=2)ln++;
	if(n-(1<<ln))ln++;
	for(int i=0;i<id;i++)t[(1<<ln)+i]=w[rk[i+1]]%p;
	for(int i=(1<<ln)-1;i>=1;i--)t[i]=(t[i*2]+t[i*2+1])%p;
	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);
			upd(x,y,z);
		}
		if(opt==2){
			int x,y;
			scanf("%d%d",&x,&y);
			printf("%d",(get(x,y)%p+p)%p);
		}
		if(opt==3){
			int x,y;
			scanf("%d%d",&x,&y);
			add(1,1<<ln,dfn[x],rid[x],1,y);
		}
		if(opt==4){
			int x;
			scanf("%d",&x);
			printf("%d\n",(getsum(1,1<<ln,dfn[x],rid[x],1)%p+p)%p);
		}
	}
	return 0;
}