#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int N = 4e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int n, p[N], f[N], g[N], ans;
vector <int> e[N];

int fa[N], sz[N];

int get(int u) {
  return u == fa[u] ? u : fa[u] = get(fa[u]);
}

void merge(int u, int v) {
  fa[get(v)] = get(u);
}

int d3(int x) {
  return (x + 1) * x * (x - 1);
} ;

void del(int u) {
  for (int x : e[u]) ans -= d3(f[get(x)]);
  int r = get(p[u]);
  -- f[r], g[r] -= f[u];
  -- f[p[r]], g[p[r]] -= (f[r] + 1) * (f[r] + 1) - f[r] * f[r];
  if (p[r] < n) -- g[p[p[r]]];
  ans -= 2 * (f[r] + 1) * f[u] + f[u] * f[u] - g[u];
  ans -= 2 * g[r];
  ans -= 2 * ((f[p[r]] - f[r]) + f[p[p[r]]]);
  for (int x : e[u]) if (get(x) != r) {
    int v = get(x);
    ans -= 2 * g[v];
    ans += 2 * (f[r] + 1) * g[v];
    ans += 2 * g[r] * f[v];
    ans += 2 * f[v] * ((f[p[r]] - f[r]) + f[p[p[r]]]);
  }
  for (int x : e[u]) if (get(x) != r) {
    int v = get(x);
    f[r] += f[v], g[r] += g[v];
    f[p[r]] += f[v], g[p[r]] += f[r] * f[r] - (f[r] - f[v]) * (f[r] - f[v]);
    merge(r, v);
  }
  ans += d3(f[r]);
}

void dfs0(int u, int fa) {
  p[u] = fa;
  for (int v : e[u]) if (v != fa) {
    dfs0(v, u);
    if (u <= n) f[u] += f[v], g[u] += f[v] * f[v];
    else ++ f[u], g[u] += f[v];
  }
}

signed main() {
  n = read();
  rep(i, 1, n - 1) {
    int u = read(), v = read();
    e[u].emplace_back(n + i), e[n + i].emplace_back(u);
    e[v].emplace_back(n + i), e[n + i].emplace_back(v);
  }
  dfs0(n, 0);
  rep(i, 1, n - 1) ans += 2 * f[p[i]] * f[i];
  rep(i, 1, n) ans += f[i] * f[i] - g[i];
  rep(i, n + 1, n + n - 1) ans += d3(f[i]);
  rep(i, 1, n + n - 1) fa[i] = i;
  rep(i, 1, n) {
    printf("%lld\n", ans);
    if (i < n) del(i);
  }
  return 0;
}