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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
|
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define debug(...) void(0)
#endif
#define int long long
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<<1)+
(x<<3)+(ch^48);ch=getchar();}return x*f;}
#define Z(x) (x)*(x)
#define pb push_back
#define fi first
#define se second
#define N 1000010
int n, m, i, j, k, T;
multiset<int>ans_set;
int dep[N], a[N], F[N], w[N], top[N], Ed[N], son[N], tot, u, v;
int dfn[N], q, op, dfn_xu[N];
vector<int>G[N];
struct Segment_tree {
#define ls (k<<1)
#define rs (k<<1|1)
#define mid ((l+r)>>1)
struct node {
int s, L, R, mx;
void mem() { s = L = R = mx = 0; }
node operator + (const node &a) const {
node b; b.mem();
b.s = s + a.s;
b.L = max(L, s + a.L);
b.R = max(a.R, R + a.s);
b.mx = max({mx, a.mx, R + a.L});
return b;
}
}a[N<<2];
multiset<int>s[N<<2];
void push_up(int k) {
a[k] = a[ls] + a[rs];
}
void build(int k, int l, int r, int *A) {
if(l == r) {
a[k].s = a[k].mx = a[k].L = a[k].R = A[dfn_xu[l]]; s[k].insert(0);
return ;
}
build(ls, l, mid, A); build(rs, mid+1, r, A);
push_up(k);
}
void add(int k, int l, int r, int x, int y) {
assert(x >= 1 && x <= n);
if(l == r) {
a[k].s = y; auto t = s[k].end(); --t;
a[k].L = a[k].R = a[k].mx = y + (*t);
if(s[k].size() >= 2) { --t; a[k].mx += max(0ll, (*t)); }
return ;
}
if(x <= mid) add(ls, l, mid, x, y);
else add(rs, mid + 1, r, x, y);
push_up(k);
}
void update(int k, int l, int r, int x, int y, int o) {
assert(x >= 1 && x <= n);
assert(k > 0 && k <= 4*n);
assert(l <= r && l >= 1 && r <= n);
assert(y <= 1e18);
if(l == r) {
if(k == 215325) debug("%lld [%lld] || %d\n", y, o, s[k].size());
if(o == 1) s[k].insert(y);
else {
if(s[k].find(y) == s[k].end()) debug("fdsfdasfadfasd\n");
s[k].erase(s[k].find(y));
}
if(k == 215325) debug("%lld [%lld] || %d\n", y, o, s[k].size());
assert(!s[k].empty());
auto t = s[k].end(); --t;
a[k].L = a[k].R = a[k].mx = a[k].s + (*t);
if(t != s[k].begin()) {
--t; a[k].mx += max(0ll, (*t));
}
return ;
}
if(x <= mid) update(ls, l, mid, x, y, o);
else update(rs, mid+1, r, x, y, o);
push_up(k);
}
node quemx(int k, int l, int r, int x, int y) {
assert(x >= 1 && x <= n);
assert(y >= 1 && y <= n);
if(l >= x && r <= y) return a[k];
node a, b; a.mem(); b.mem();
if(x <= mid) a = quemx(ls, l, mid, x, y); else return quemx(rs, mid+1, r, x, y);
if(y >= mid+1) b = quemx(rs, mid+1, r, x, y); else return a;
return a + b;
}
pair<int, int> queRmx(int k, int l, int r, int x, int y) {
assert(x >= 1 && x <= n);
assert(y >= 1 && y <= n);
if(l >= x && r <= y) return {a[k].s, a[k].L};
pair<int, int> ta, tb, t;
if(x <= mid) ta = queRmx(ls, l, mid, x, y);
else return queRmx(rs, mid + 1, r, x, y);
if(y >= mid + 1) tb = queRmx(rs, mid + 1, r, x, y);
else return ta;
return {ta.fi + tb.fi, max(ta.se, ta.fi + tb.se)};
}
#undef ls
#undef rs
#undef mid
}Seg;
namespace Tree {
void dfs(int x, int fa) {
dep[x] = dep[fa] + a[x]; w[x] = 1; F[x] = fa;
for(int y : G[x]) if(y != fa) {
dfs(y, x); w[x] += w[y];
if(w[y] > w[son[x]]) son[x] = y;
}
}
int dfs2(int x, int fa, int Top) {
top[x] = Top; dfn[x] = ++tot; Ed[x] = x; dfn_xu[tot] = x;
if(son[x]) Ed[x] = dfs2(son[x], x, Top);
for(int y : G[x]) if(y != fa && y != son[x]) { dfs2(y, x, y); }
return Ed[x];
}
void dfs3(int x, int fa) {
for(int y : G[x]) if(y != fa) { dfs3(y, x); }
if(x == top[x]) {
int qmx = Seg.quemx(1, 1, n, dfn[x], dfn[Ed[x]]).mx;
ans_set.insert(qmx);
auto qR = Seg.queRmx(1, 1, n, dfn[x], dfn[Ed[x]]);
if(fa) { Seg.update(1, 1, n, dfn[fa], qR.se, 1); }
}
}
void Main() {
for(i=1; i<n; ++i) {
u = read(); v = read();
G[u].pb(v); G[v].pb(u);
}
for(i=1; i<=n; ++i) a[i] = read();
dfs(1, 0); dfs2(1, 0, 1);
Seg.build(1, 1, n, a);
dfs3(1, 0);
}
}
namespace Operation {
void Update(int x, int y) {
stack<int>z;
int k = x; x = top[x];
while(1) {
z.push(x); if(!F[x]) break; x = F[x]; x = top[x]; }
while(!z.empty()) {
x = z.top(); z.pop();
int qmx = Seg.quemx(1, 1, n, dfn[x], dfn[Ed[x]]).mx;
ans_set.erase(ans_set.find(qmx));
auto qR = Seg.queRmx(1, 1, n, dfn[x], dfn[Ed[x]]);
if(F[x]) { Seg.update(1, 1, n, dfn[F[x]], qR.se, -1); }
}
x = k;
Seg.add(1, 1, n, dfn[x], y);
x = top[x];
while(1) {
int qmx = Seg.quemx(1, 1, n, dfn[x], dfn[Ed[x]]).mx;
ans_set.insert(qmx);
auto topmx = Seg.queRmx(1, 1, n, dfn[x], dfn[Ed[x]]);
if(F[x]) { Seg.update(1, 1, n, dfn[F[x]], topmx.se, 1); }
else break;
x = F[x]; x = top[x];
}
}
int Qans() {
auto t = ans_set.end(); --t;
return (*t);
}
void Main() {
int cnt = 0;
while(q--) {
op = read();
if(q<=80769) debug("%d\n", q);
if(op == 1) {
printf("%lld\n", Qans());
}
if(op == 2) {
u = read();
Update(u, 1e16);
int k = Qans();
printf("%lld\n", k - (int)1e16 + a[u]);
Update(u, a[u]);
}
if(op == 3) {
u = read(); v = read();
Update(u, v); a[u] = v;
}
}
}
}
signed main()
{
freopen("taffy.in", "r", stdin);
freopen("taffy.out", "w", stdout);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
n = read(); q = read();
Tree :: Main();
Operation :: Main();
return 0;
}
|
