/** * author: otera * created: 22.10.2021 22:23:55 **/ #include using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; using uint = unsigned; #define repa(i, n) for(int i = 0; i < n; ++ i) #define repb(i, a, b) for(int i = a; i < b; ++ i) #define repc(i, a, b, c) for(int i = a; i < b; i += c) #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__) #define rep1a(i, n) for(int i = 0; i <= n; ++ i) #define rep1b(i, a, b) for(int i = a; i <= b; ++ i) #define rep1c(i, a, b, c) for(int i = a; i <= b; i += c) #define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__) #define per(i,n) for(int i=n-1;i>=0;i--) #define per1(i,n) for(int i=n;i>=1;i--) typedef pair P; typedef pair LP; #define pb push_back #define eb emplace_back #define fr first #define sc second #define all(c) c.begin(),c.end() #define lb(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define ub(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define Sort(a) sort(all(a)) #define Rev(a) reverse(all(a)) #define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define si(c) (int)(c).size() inline ll popcnt(ull a){ return __builtin_popcountll(a); } #define tpow(n) (1LL<<(n)) #define unless(A) if(!(A)) ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vectorname(__VA_ARGS__) #define VEC(type,name,size) vectorname(size);in(name) #define vv(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define VV(type,name,h,w) vector>name(h,vector(w));in(name) #define vvv(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; template void scan(T& a){ cin >> a; } template void scan(vector& a){ for(auto&& i : a) scan(i); } void in(){} template void in(Head& head, Tail&... tail){ scan(head); in(tail...); } void print(){ cout << ' '; } template void print(const T& a){ cout << a; } template void print(const vector& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } } int out(){ cout << '\n'; return 0; } template int out(const T& t){ print(t); cout << '\n'; return 0; } template int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; } #define CHOOSE(a) CHOOSE2 a #define CHOOSE2(a0,a1,a2,a3,a4,x,...) x #define debug_1(x1) cout<<#x1<<": "< struct Rerooting { struct Edge { int to; U date; T dp; }; using F1 = function< T(T, T) >; using F2 = function< T(T, U) >; vector> g; vector dp, subdp; const T ident; const F1 f1; const F2 f2; Rerooting(int n, const F1 &f1, const F2 &f2, const T &ident) : g(n), f1(f1), f2(f2), dp(n, ident), subdp(n, ident), ident(ident) {} void add_edge(int s, int t, const U &d) { g[s].emplace_back((Edge) {t, d, ident}); g[t].emplace_back((Edge) {s, d, ident}); } void add_edge_bi(int s, int t, const U &d, const U &e) { g[s].emplace_back((Edge) {t, d, ident}); g[t].emplace_back((Edge) {s, e, ident}); } void rec(int v, int par) { for(auto &e: g[v]) { if(e.to == par) continue; rec(e.to, v); subdp[v] = f1(subdp[v], f2(subdp[e.to], e.date)); } } void rerec(int v, int par, const T &pval) { int sz = (int)g[v].size(); vector left(sz + 1, ident), right(sz + 1, ident); for(int i = 0; i < sz; ++ i) { auto &e = g[v][i]; e.dp = f2(par == e.to ? pval : subdp[e.to], e.date); left[i + 1] = f1(left[i], e.dp); } dp[v] = left[sz]; for(int i = 0; i < sz; ++ i) { auto &e = g[v][sz - 1 - i]; if(e.to != par) { rerec(e.to, v, f1(left[sz - 1 - i], right[i])); } right[i + 1] = f1(right[i], e.dp); } } vector build(int r) { rec(r, -1); rerec(r, -1, ident); return dp; } }; void solve() { INT(n, k); vvc g(n); vc deg(n); vc

es(n - 1); rep(i, n - 1) { INT(u, v); -- u, -- v; es[i] = {u, v}; g[u].eb(v); g[v].eb(u); ++ deg[u], ++ deg[v]; } VEC(int, d, k); vc check(n, 0); rep(i, k) { -- d[i]; check[d[i]] = 1; } vc

di(n); queue> que; vc used(n, 0); rep(i, n) { if(check[i]) { que.push({i, i, 0}); } } while(que.size()) { auto [v, from, dist] = que.front(); que.pop(); di[v] = {dist, from}; used[v] = 1; for(int nv: g[v]) { if(used[nv]) continue; que.push({nv, from, dist + 1}); } } queue nque; rep(i, n) { if(deg[i] == 1 and !check[i]) { // leaf nque.push(i); } } vc noneed(n, 0); while(nque.size()) { int v = nque.front(); nque.pop(); noneed[v] = 1; for(int nv: g[v]) { -- deg[nv]; if(noneed[nv]) continue; if(deg[nv] == 1 and !check[nv]) { nque.push(nv); } } } int r = d[0]; function f1 = [&](P a, P b) -> P { return P(a.first + b.first, a.first + b.first - max(a.first - a.second, b.first - b.second)); }; function f2 = [&](P a, int c) -> P { return P(a.fr + 2, a.sc + 1); }; vc vs; rep(i, n) { if(!noneed[i]) { vs.eb(i); } } Uniq(vs); int N = si(vs); debug(N); vvc G(N); rep(i, n - 1) { if(noneed[es[i].fr] or noneed[es[i].sc]) continue; int u = lb(vs, es[i].fr), v = lb(vs, es[i].sc); // ++ deg2[u], ++ deg2[v]; G[u].eb(v); G[v].eb(u); } vc ans(n); // Rerooting rt(N, f1, f2, P{0, 0}); vc deg2(N, 0); rep(i, n - 1) { if(noneed[es[i].fr] or noneed[es[i].sc]) continue; int u = lb(vs, es[i].fr), v = lb(vs, es[i].sc); ++ deg2[u], ++ deg2[v]; } rep(i, n - 1) { if(noneed[es[i].fr] or noneed[es[i].sc]) continue; int u = lb(vs, es[i].fr), v = lb(vs, es[i].sc); debug(u, v, deg2[v], deg2[u]); rt.add_edge_bi(u, v, deg2[u] - 1, deg2[v] - 1); } vc

dp = rt.build(lb(vs, r)); // int sum = dp[lb(vs, r)].fr; auto dfs = [&](auto&&self, int v, int p, vc &dist, int d) -> void { dist[v] = d; for(int nv: G[v]) { if(nv == p) continue; self(self, nv, v, dist, d + 1); } }; vc di0(N); dfs(dfs, 0, -1, di0, 0); int now = -1, x = -1; rep(i, N) { if(chmax(now, di0[i])) { x = i; } } vc dix(N), diy(N); dfs(dfs, x, -1, dix, 0); now = -1; int y = -1; rep(i, N) { if(chmax(now, dix[i])) { y = i; } } dfs(dfs, y, -1, diy, 0); rep(i, n) { if(!noneed[i]) { ans[i] = sum - max(dix[lb(vs, i)], diy[lb(vs, i)]); } } rep(i, n) { if(noneed[i]) { int dist = di[i].fr, from = di[i].sc; ans[i] = ans[from] + dist; } } rep(i, n) { out(ans[i]); } } signed main() { ios::sync_with_stdio(false); cin.tie(0); // cout << fixed << setprecision(20); // INT(t); rep(i, t)solve(); solve(); return 0; }