1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
| #include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &a){
T w = 1; a = 0;
char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') w = -1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) a = (a * 10) + (ch - '0');
a *= w;
}
template <typename T> inline void ckmax(T &a, T b){a = a > b ? a : b;}
template <typename T> inline void ckmin(T &a, T b){a = a < b ? a : b;}
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mii map<int, int>
#define pii pair<int, int>
#define vi vector<int>
#define si set<int>
#define ins insert
#define era erase
#define Debug(x) cout << #x << " = " << x << endl
#define For(i,l,r) for (int i = l; i <= r; ++i)
#define foR(i,l,r) for (int i = l; i >= r; --i)
#define int long long
const int N = 1e5 + 10;
int n, m;
int val[N];
vi to[N];
int dep[N], dp[N][32];
int dfn[N], dfntot, rnk[N];
int low[N];
void dfs (int u, int fa) {
rnk[dfn[u] = ++dfntot] = u;
dep[u] = dep[fa] + 1;
dp[u][0] = fa;
for (int i = 1; (1 << i) <= dep[u]; ++i)
dp[u][i] = dp[dp[u][i - 1]][i - 1];
for (auto v : to[u]) {
if (v == fa) continue;
dfs(v, u);
}
low[u] = dfntot;
}
int LCA (int x, int y) {
if (dep[x] < dep[y]) swap(x, y);
foR (i, 20, 0) if (dep[x] - (1 << i) >= dep[y]) x = dp[x][i];
if (x == y) return x;
foR (i, 20, 0) if (dp[x][i] != dp[y][i]) x = dp[x][i], y = dp[y][i];
return dp[x][0];
}
int LCA_son (int x, int y) {
if (dep[x] < dep[y]) swap(x, y);
foR (i, 20, 0) if (dep[x] - (1 << i) > dep[y]) x = dp[x][i];
if (dp[x][0] == y) return x;
foR (i, 20, 0) if (dp[x][i] != dp[y][i]) x = dp[x][i], y = dp[y][i];
return x;
}
#define ls x << 1
#define rs x << 1 | 1
int tag[N << 2], sum[N << 2];
inline void pushup (int x) { sum[x] = sum[ls] + sum[rs]; }
inline void push (int x, int l, int r, int v) {
tag[x] += v, sum[x] += (r - l + 1) * v;
}
inline void pushdown (int x, int l, int r) {
if (tag[x]) {
int mid = l + r >> 1;
push(ls, l, mid, tag[x]), push(rs, mid + 1, r, tag[x]);
tag[x] = 0;
}
}
void build (int x, int l, int r) {
if (l == r) return (sum[x] = val[rnk[l]]), void();
int mid = l + r >> 1;
build (ls, l, mid), build (rs, mid + 1, r);
pushup(x);
}
void update (int x, int l, int r, int ll, int rr, int v) {
if (ll <= l && r <= rr) return push(x, l, r, v), void();
int mid = l + r >> 1;
pushdown(x, l, r);
if (ll <= mid) update (ls, l, mid, ll, rr, v);
if (rr > mid) update(rs, mid + 1, r, ll, rr, v);
pushup(x);
}
int query (int x, int l, int r, int ll, int rr) {
if (ll <= l && r <= rr) return sum[x];
int ans = 0, mid = l + r >> 1;
pushdown(x, l, r);
if (ll <= mid) ans += query (ls, l, mid, ll, rr);
if (rr > mid) ans += query (rs, mid + 1, r, ll, rr);
return ans;
}
int rt, Mck;
signed main() {
read(n), read(m);
For (i, 1, n) read(val[i]);
For (i, 2, n) {
int u, v; read(u), read(v);
to[u].pb(v), to[v].pb(u);
}
dfs(1, 0);
build (1, 1, n);
rt = 1;
For (i, 1, m) {
int op; read(op);
if (op == 1) read(rt);
if (op == 2) {
int u, v, det; read(u), read(v); read(det);
int lca = LCA(u, v);
int tmp = LCA(u, rt);
(dep[tmp] > dep[lca]) ? lca = tmp : Mck = 1;
tmp = LCA(v, rt);
(dep[tmp] > dep[lca]) ? lca = tmp : Mck = 1;
int llccaa = LCA(lca, rt);
if (llccaa != lca && llccaa != rt) {
update(1, 1, n, dfn[lca], low[lca], det);
continue;
}
if (lca == rt) push(1, 1, n, det);
else if (llccaa == rt) {
update (1, 1, n, dfn[lca], low[lca], det);
}
else {
Mck = LCA_son(lca, rt);
push(1, 1, n, det);
update(1, 1, n, dfn[Mck], low[Mck], -det);
}
}
if (op == 3) {
int u; read(u);
if (u == rt) {
printf ("%lld\n", query(1, 1, n, 1, n));
continue; }
int lca = LCA(u, rt);
if (lca != u && lca != rt) {
printf ("%lld\n", query(1, 1, n, dfn[u], low[u]));
continue;
}
if (u == rt) printf ("%lld\n", query (1, 1, n, 1, n));
else if ( lca == rt )
printf ("%lld\n", query(1, 1, n, dfn[u], low[u]));
else {
Mck = LCA_son(u, rt);
printf ("%lld\n", query (1, 1, n, 1, n) - query (1, 1, n, dfn[Mck], low[Mck]));
}
}
}
return 0;
}
|
