#include // #include // #include using namespace std; // using namespace atcoder; // using bint = boost::multiprecision::cpp_int; using ll = long long; using ull = unsigned long long; using P = pair; #define rep(i,n) for(ll i = 0;i < (ll)n;i++) #define ALL(x) (x).begin(),(x).end() #define MOD 1000000007 // 2020/12/31 struct Rerooting{ struct DP{ /* add variables ,edit constructer and functions */ ll s = 0,x = 0; DP(){} DP operator+(const DP& o){ DP res; res.x = this->x + o.x; res.s = this->s + o.s; return res; } DP addRoot()const{ DP res(*this); res.x++; res.s += res.x; return res; } }; vector> v; vector> dp; vector res; Rerooting(int n = 0) : v(n),dp(n),res(n) {} void add_edge(int a,int b){ v[a].push_back(b); v[b].push_back(a); } void init(){ dfs(0); bfs(0); } DP dfs(int ov,int pre = -1){ DP S; int deg = v[ov].size(); dp[ov] = vector(deg); for(int i = 0;i < deg;i++){ int nv = v[ov][i]; if(nv == pre)continue; dp[ov][i] = dfs(nv,ov); S = S + dp[ov][i]; } return S.addRoot(); } void bfs(int ov,const DP &dp_pre = DP(),int pre = -1){ int deg = v[ov].size(); vector L(deg+1),R(deg+1); for(int i = 0;i < deg;i++)if(v[ov][i] == pre)dp[ov][i] = dp_pre; for(int i = 0;i < deg;i++)L[i+1] = L[i] + dp[ov][i]; for(int i = deg-1;i >= 0;i--)R[i] = R[i+1] + dp[ov][i]; res[ov] = L[deg].addRoot(); for(int i = 0;i < deg;i++){ int nv = v[ov][i]; if(nv == pre)continue; bfs(nv,(L[i] + R[i+1]).addRoot(),ov); } } }; int main(){ int n; cin >> n; Rerooting rt(n); rep(i,n-1){ int a,b;cin >> a >> b; a--;b--; rt.add_edge(a,b); } rt.init(); ll res = 0; rep(i,n)res += rt.res[i].s; cout << res << "\n"; return 0; }