树链剖分

#include<cstdio>
#include<iostream>
#define lc(x) x<<1
#define rc(x) x<<1|1
using namespace std;
const int MAXN=1e6+5;
int n,m,rt,mod,cnt,tot,a[MAXN],head[MAXN];
int fa[MAXN],top[MAXN],size[MAXN],dep[MAXN],son[MAXN],dfn[MAXN],w[MAXN];
struct edge
{
	int next,to;
}e[MAXN];
struct node
{
	int l,r,sum,add;
}t[MAXN];
void addage(int u,int v)
{
	e[++cnt].next=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
void dfs1(int u,int f)
{
	fa[u]=f;
	dep[u]=dep[f]+1;
	size[u]=1;
	for (int i=head[u];i;i=e[i].next)
	{
		int v=e[i].to;
		if (v==f) continue;
		dfs1(v,u);
		size[u]+=size[v];
		if (size[son[u]]<size[v]||son[u]==0) son[u]=v;	
	}
}
void dfs2(int u,int d)
{
	dfn[u]=++tot;
	w[tot]=a[u];
	top[u]=d;
	if (son[u]!=0) dfs2(son[u],d);
	for (int i=head[u];i;i=e[i].next)
	{
		int v=e[i].to;
		if (v==fa[u]||v==son[u]) continue;
		dfs2(v,v);
	}
}
void pushup(int p)
{
	t[p].sum=(t[lc(p)].sum+t[rc(p)].sum)%mod;
}
void build(int l,int r,int p)
{
	t[p].l=l;
	t[p].r=r;
	if (l==r)
	{
		t[p].sum=w[l];
		return;
	}
	int mid=(l+r)>>1;
	build(l,mid,lc(p));
	build(mid+1,r,rc(p));
	pushup(p);
}
int len(int p)
{
	return t[p].r-t[p].l+1;
}
void pushdown(int p)
{
	if (t[p].add!=0)
	{
		t[lc(p)].add=(t[lc(p)].add+t[p].add)%mod;
		t[rc(p)].add=(t[rc(p)].add+t[p].add)%mod;
		t[lc(p)].sum=(t[lc(p)].sum+len(lc(p))*t[p].add)%mod;
		t[rc(p)].sum=(t[rc(p)].sum+len(rc(p))*t[p].add)%mod;
		t[p].add=0;
	}
}
void change(int l,int r,int k,int p)
{
	if (l<=t[p].l&&r>=t[p].r)
	{
		t[p].add=(t[p].add+k)%mod;
		t[p].sum=(t[p].sum+k*len(p))%mod;
		return;
	}
	pushdown(p);
	int mid=(t[p].l+t[p].r)>>1;
	if (l<=mid) change(l,r,k,lc(p));
	if (r>mid) change(l,r,k,rc(p));
	pushup(p);
}
int ask(int l,int r,int p)
{
	int ans=0;
	if (l<=t[p].l&&r>=t[p].r)
	{
		return t[p].sum%mod;
	}
	pushdown(p);
	int mid=(t[p].l+t[p].r)>>1;
	if (l<=mid) ans=(ans+ask(l,r,lc(p)))%mod;
	if (r>mid) ans=(ans+ask(l,r,rc(p)))%mod;
	return ans%mod;
}
void update(int x,int y,int k)
{
	k=k%mod;
	while (top[x]!=top[y])
	{
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		change(dfn[top[x]],dfn[x],k,1);
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	change(dfn[x],dfn[y],k,1);
}
int query(int x,int y)
{
	int ans=0;
	while (top[x]!=top[y])
	{
		if (dep[top[x]]<dep[top[y]]) swap(x,y);
		ans=(ans+ask(dfn[top[x]],dfn[x],1))%mod;
		x=fa[top[x]];
	}
	if (dep[x]>dep[y]) swap(x,y);
	ans=(ans+ask(dfn[x],dfn[y],1))%mod;
	return ans%mod;
}
int main()
{
	scanf("%d%d%d%d",&n,&m,&rt,&mod);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	for (int i=1;i<n;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		addage(x,y);
		addage(y,x);
	}
	dfs1(rt,0);
	dfs2(rt,rt);
	build(1,n,1);
	for (int i=1;i<=m;i++)
	{
		int f,x,y,z;
		scanf("%d",&f);
		if (f==1)
		{
			scanf("%d%d%d",&x,&y,&z);
			update(x,y,z);
		}
		else if (f==2)
		{
			scanf("%d%d",&x,&y);
			printf("%d\n",query(x,y));
		}
		else if (f==3)
		{
			scanf("%d%d",&x,&z);
			change(dfn[x],dfn[x]+size[x]-1,z,1);
		}
		else if (f==4)
		{
			scanf("%d",&x);
			printf("%d\n",ask(dfn[x],dfn[x]+size[x]-1,1));
		} 
	}
	return 0;
}