题目传送门:portal
%%%SBW,把我卡到飞、。
upd:pickupwin太强辣!更新了一波数据就又把我卡成狗啦!
强行手动模拟dfs才能过呀x,为了保证dfs序的性质,我们要用双端队列呀x
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1000010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,a[N],h[N],num=0,fa[N][22],in[N],out[N],dfn=0,dep[N],c[N],Log[N];
struct edge{
int to,next;
}data[N<<1];
deque<int>q;
inline void dfs(int rt){
q.push_back(rt);
while(!q.empty()){
int x=q.front();q.pop_front();
if(in[x]){out[x]=dfn;continue;}
for(int i=1;i<=Log[n];++i){
if(!fa[x][i-1]) break;
fa[x][i]=fa[fa[x][i-1]][i-1];
}in[x]=++dfn;q.push_front(x);
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(fa[x][0]==y) continue;
fa[y][0]=x;dep[y]=dep[x]+1;q.push_front(y);
}
}
}
inline int lca(int x,int y){
if(dep[x]<dep[y]) swap(x,y);
int d=dep[x]-dep[y];
for(int i=0;i<=Log[d];++i)
if(d>>i&1) x=fa[x][i];
if(x==y) return x;
for(int i=Log[n];i>=0;--i)
if(fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
return fa[x][0];
}
inline void add(int x,int val){for(;x<=n;x+=x&-x) c[x]+=val;}
inline int ask(int x){
int res=0;
for(;x;x-=x&-x) res+=c[x];return res;
}
int main(){
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
n=read();m=read();for(int i=1;i<=n;++i) a[i]=read();
for(int i=1;i<=n;++i) Log[i]=Log[i>>1]+1;
for(int i=1;i<n;++i){
int x=read(),y=read();
data[++num].to=y;data[num].next=h[x];h[x]=num;
data[++num].to=x;data[num].next=h[y];h[y]=num;
}dfs(1);
while(m--){
int op=read();
if(op){
int x=read(),y=read(),val=read(),t=lca(x,y);
add(in[x],val);add(in[y],val);add(in[t],-val);
if(fa[t][0]) add(in[fa[t][0]],-val);
}else{
int x=read();
printf("%d\n",a[x]+ask(out[x])-ask(in[x]-1));
}
}return 0;
}