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
| #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
inline void proc_status ()
{
ifstream t ("/proc/self/status");
cerr << string (istreambuf_iterator <char> (t), istreambuf_iterator <char> ()) << endl;
}
template <typename T> inline int Chkmax (T &a, T b) {return a < b ? a = b, 1 : 0;}
template <typename T> inline int Chkmin (T &a, T b) {return a > b ? a = b, 1 : 0;}
inline int read ()
{
int sum = 0, fl = 1; char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') fl = -1;
for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - '0';
return sum * fl;
}
const int Maxn = 3e5 + 100;
int N, M;
int e, Begin[Maxn], To[Maxn << 1], Next[Maxn << 1], W[Maxn];
pii E[Maxn];
inline void add_edge (int x, int y) { To[++e] = y; Next[e] = Begin[x]; Begin[x] = e; }
int dep[Maxn], anc[22][Maxn];
inline void dfs_pre (int x)
{
dep[x] = dep[anc[0][x]] + 1;
for (int i = 1; i <= 20; ++i) anc[i][x] = anc[i - 1][anc[i - 1][x]];
for (int i = Begin[x]; i; i = Next[i])
{
int y = To[i];
if (y == anc[0][x]) continue;
anc[0][y] = x;
dfs_pre (y);
}
}
inline int get_lca (int x, int y)
{
if (dep[x] < dep[y]) swap(x, y);
for (int i = 20; i >= 0; --i) if (dep[anc[i][x]] >= dep[y]) x = anc[i][x];
if (x == y) return x;
for (int i = 20; i >= 0; --i) if (anc[i][x] != anc[i][y]) x = anc[i][x], y = anc[i][y];
return anc[0][x];
}
vector <int> vec1[Maxn], vec2[Maxn];
int buc[Maxn], Ans[Maxn];
inline void dfs_up (int x)
{
int sum = buc[dep[x] + W[x]];
for (int i = 0; i < vec1[x].size(); ++i) ++buc[vec1[x][i]];
for (int i = Begin[x]; i; i = Next[i])
{
int y = To[i];
if (y == anc[0][x]) continue;
dfs_up (y);
}
Ans[x] += buc[dep[x] + W[x]] - sum;
for (int i = 0; i < vec2[x].size(); ++i) --buc[vec2[x][i]];
}
inline int dis (int x, int y, int k) { return dep[x] + dep[y] - 2 * dep[k]; }
inline void dfs_down (int x)
{
int sum = buc[W[x] - dep[x]];
for (int i = 0; i < vec1[x].size(); ++i) ++buc[vec1[x][i]];
for (int i = Begin[x]; i; i = Next[i])
{
int y = To[i];
if (y == anc[0][x]) continue;
dfs_down (y);
}
for (int i = 0; i < vec2[x].size(); ++i) --buc[vec2[x][i]];
Ans[x] += buc[W[x] - dep[x]] - sum;
}
inline void Solve ()
{
dfs_pre (1);
for (int i = 1; i <= M; ++i)
{
int k = get_lca (E[i].x, E[i].y);
vec1[E[i].x].pb(dep[E[i].x]);
vec2[k].pb(dep[E[i].x]);
}
dfs_up (1);
memset(buc, 0, sizeof buc);
for (int i = 1; i <= N; ++i) vec1[i].clear(), vec2[i].clear();
for (int i = 1; i <= M; ++i)
{
int k = get_lca (E[i].x, E[i].y), sum = dis(E[i].x, E[i].y, k) - dep[E[i].y];
vec1[E[i].y].pb(sum);
vec2[k].pb(sum);
}
dfs_down (1);
for (int i = 1; i <= N; ++i) printf("%d ", Ans[i]);
puts("");
}
inline void Input ()
{
N = read(), M = read();
for (int i = 1; i < N; ++i)
{
int x = read(), y = read();
add_edge (x, y);
add_edge (y, x);
}
for (int i = 1; i <= N; ++i) W[i] = read();
for (int i = 1; i <= M; ++i) E[i].x = read(), E[i].y = read();
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("running.in", "r", stdin);
freopen("running.out", "w", stdout);
#endif
Input();
Solve();
return 0;
}
|