#define ATCODER #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define VL vector #define VVL vector> #define VP vector< pair > #define VVP vector>> #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define MP(a,b) make_pair(a,b) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } template T det2(array ar) { return ar[0] * ar[3] - ar[1] * ar[2]; } template T det3(array ar) { return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6]; } template bool chmax(T& tar, T src) { return tar < src ? tar = src, true : false; } template bool chmin(T& tar, T src) { return tar > src ? tar = src, true : false; } template void inc(vector& ar) { for (auto& v : ar) v++; } template void dec(vector& ar) { for (auto& v : ar) v--; } template vector> id_sort(vector& a) { vector res(a.size()); for (int i = 0; i < a.size(); i++)res[i] = MP(a[i], i); SORT(res); return res; } using val = pair; using func = ll; val op(val a, val b) { return MP(a.first + b.first, a.second + b.second); } val e() { return MP(0LL, 0LL); } val mp(func f, val a) { return MP(f * a.second, a.second); } func comp(func f, func g) { if (g == -1)return f; else return g; } func id() { return -1; } val mp2(func f, val a) { if (f == -1) { return e(); } return MP(a.first + f * a.second, a.second); } func comp2(func f, func g) { if (f == -1) { return g; } if (g == -1) { return -1; } return f + g; } func id2() { return 0; } // Rook ll dxr[4] = { 1,0,-1,0 }; ll dyr[4] = { 0,1,0,-1 }; // Bishop ll dxb[4] = { -1,-1,1,1 }; ll dyb[4] = { -1,1,-1,1 }; // qween ll dxq[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dyq[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { // 直径の例の図を考えればよさそう // とはいえWAに戻ろう ll n; cin >> n; VVP g(n); REP(i, n - 1) { ll u, v; cin >> u >> v; u--; v--; g[u].emplace_back(v, i); g[v].emplace_back(u, i); } auto dfs = [&](auto self, ll now, ll parent)-> pair { pair res; res.first = 0; res.second = now; for (auto& [v, i] : g[now]) { if (v == parent) continue; auto r = self(self, v, now); r.first++; chmax(res, r); } return res; }; auto [d0, v0] = dfs(dfs, 0, -1); auto [d1, v1] = dfs(dfs, v0, -1); VL dd(n); VL ans(n - 1); VL ans2(n - 1); auto dfs2 = [&](auto self, ll now, ll goal, ll dist, ll parent)-> pair { pair res; chmax(dd[now], dist); res.first = 1; res.second = now == goal; for (auto& [v, i] : g[now]) { if (v == parent) continue; auto r = self(self, v, goal, dist + 1, now); if ((dist + 1) * 2 > d1) res.first += r.first; res.second |= r.second; if (!r.second) { ans[i] = r.first; chmax(ans2[i], dist); } else if (dist * 2 < d1) { ans[i] = r.first; chmax(ans2[i], dist); } } return res; }; dfs2(dfs2, v0, v1, 0, -1); dfs2(dfs2, v1, v0, 0, -1); ll sum = 0; REP(i, n)sum += dd[i]; REP(i, n - 1) { cout << sum - ans[i] - ans2[i] << "\n"; } return; } int main() { ll t = 1; // cin >> t; while (t--) { solve(); } return 0; }