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 | #include <bits/stdc++.h>
using namespace std;
namespace IO
{
#define siz 1 << 20
char buf[siz], *pa = buf, *pb = buf;
#define gc() (pa == pb && (pb = (pa = buf) + fread(buf, 1, siz, stdin), pa == pb)) ? EOF : *(pa++)
inline int read()
{
int x = 0, f = 1;
char ch;
for (ch = gc(); !isdigit(ch); ch = gc())
if (ch == '-') f = -1;
for (; isdigit(ch); ch = gc())
{
x = (x << 3) + (x << 1) + (ch - '0');
}
return f * x;
}
inline void write(int x)
{
if (x < 0)
{
putchar('-');
x = -x;
}
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
return;
}
#undef siz
#undef gc
} // namespace IO
using IO::read;
using IO::write;
#define MAXN 100010
int mod;
// val fa siz deep hon dfn top are real.
int idx, val[MAXN], fa[MAXN], rnk[MAXN], deep[MAXN], dfn[MAXN], hon[MAXN], siz[MAXN], n, m, root, top[MAXN];
class ST
{
public:
int data[MAXN << 2], lazy[MAXN << 2];
#define ls(x) ((x) << 1)
#define rs(x) ((x) << 1 | 1)
int bulid(int x, int l, int r)
{
lazy[x] = 0;
if (l == r)
{
return data[x] = val[rnk[l]] % mod;
}
int mid = (l + r) >> 1;
return data[x] = (bulid(ls(x), l, mid) + bulid(rs(x), mid + 1, r)) % mod;
}
inline void pd(int x, int l, int r)
{
int mid = (l + r) >> 1;
data[ls(x)] = (data[ls(x)] + (mid - l + 1) * lazy[x]) % mod;
data[rs(x)] = (data[rs(x)] + (r - mid) * lazy[x]) % mod;
lazy[ls(x)] = (lazy[ls(x)] + lazy[x]) % mod;
lazy[rs(x)] = (lazy[rs(x)] + lazy[x]) % mod;
lazy[x] = 0;
return;
}
void update(int x, int l, int r, int tl, int tr, int k)
{
if (tl <= l && r <= tr)
{
data[x] = (data[x] + k * (r - l + 1)) % mod;
lazy[x] = (lazy[x] + k) % mod;
return;
}
if (r < tl || l > tr) return;
int mid = (l + r) >> 1;
pd(x, l, r);
if (tl <= mid) update(ls(x), l, mid, tl, tr, k);
if (mid < tr) update(rs(x), mid + 1, r, tl, tr, k);
data[x] = (data[ls(x)] + data[rs(x)]) % mod;
return;
}
int query(int x, int l, int r, int tl, int tr)
{
if (tl <= l && r <= tr) return data[x];
if (r < tl || l > tr) return 0;
int mid = (l + r) >> 1, ret = 0;
pd(x, l, r);
if (tl <= mid) ret = (ret + query(ls(x), l, mid, tl, tr)) % mod;
if (mid < tr) ret = (ret + query(rs(x), mid + 1, r, tl, tr)) % mod;
return ret;
}
} st;
vector<int> e[MAXN];
void dfs1(int u, int f)
{
deep[u] = deep[fa[u] = f] + 1;
siz[u] = 1;
for (int &v : e[u])
{
if (v ^ f)
{
dfs1(v, u);
siz[u] += siz[v];
if (siz[hon[u]] < siz[v]) hon[u] = v;
}
}
}
void dfs2(int u, int t)
{
dfn[u] = ++idx;
top[u] = t;
rnk[idx] = u;
if (hon[u]) dfs2(hon[u], t);
for (int &v : e[u])
{
if (!dfn[v]) dfs2(v, v);
}
}
inline void add_son(int x, int z) { st.update(1, 1, n, dfn[x], dfn[x] + siz[x] - 1, z); }
inline void add_path(int x, int y, int z)
{
z %= mod;
while (top[x] != top[y])
{
if (deep[top[x]] < deep[top[y]]) swap(x, y);
st.update(1, 1, n, dfn[top[x]], dfn[x], z);
x = fa[top[x]];
}
if (deep[x] > deep[y]) swap(x, y); // now x is y's grandfather
st.update(1, 1, n, dfn[x], dfn[y], z);
}
inline int query_path(int x, int y)
{
int res = 0;
while (top[x] != top[y])
{
if (deep[top[x]] < deep[top[y]]) swap(x, y);
res = (res + st.query(1, 1, n, dfn[top[x]], dfn[x])) % mod;
x = fa[top[x]];
}
if (deep[x] > deep[y]) swap(x, y); // now x is y's grandfather
res = (res + st.query(1, 1, n, dfn[x], dfn[y])) % mod;
return res;
}
inline int query_son(int x) { return st.query(1, 1, n, dfn[x], dfn[x] + siz[x] - 1); }
int main()
{
n = read(), m = read(), root = read(), mod = read();
for (int i = 1; i <= n; i++) val[i] = read();
for (int i = 1; i < n; i++)
{
int u = read(), v = read();
e[u].push_back(v);
e[v].push_back(u);
}
dfs1(root, root);
dfs2(root, root);
st.bulid(1, 1, n);
while (m--)
{
int opt = read(), x, y, z;
switch (opt)
{
case 1:
x = read(), y = read(), z = read();
add_path(x, y, z);
break;
case 2:
x = read(), y = read();
write(query_path(x, y));
puts("");
break;
case 3:
x = read(), z = read();
add_son(x, z);
break;
case 4:
x = read();
write(query_son(x));
puts("");
break;
}
}
return 0;
}
|