#include using namespace std; #define fs first #define sc second #define pb push_back #define mp make_pair #define eb emplace_back #define ALL(A) A.begin(),A.end() #define RALL(A) A.rbegin(),A.rend() typedef long long LL; typedef pair P; 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; } template T gcd(T a,T b){return b?gcd(b,a%b):a;} const LL mod=998244353; const LL LINF=1LL<<62; const int INF=1<<30; int dx[]={1,0,-1,0,-1,1,1,-1}; int dy[]={0,1,0,-1,-1,-1,1,1}; LL a[1<<18]; vector G[1<<18]; LL f(int u,int v){ LL c = 1; a[u] = 1; for(auto g:G[u]){ if(g == v) continue; LL l = f(g, u); a[u] += 2 * l * c; c += l; } return c; } int main(){ int n;cin >> n; for (int i = 0; i < n - 1; i++) { int u,v;cin >> u >> v; u--,v--; G[u].pb(v); G[v].pb(u); } f(0,0); for (int i = 0; i < n; i++) { cout << a[i] << endl; } return 0; }