#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,head[400040],cnt=0,f[400040],d[400040],dep[400040],tg[400040],ans=0;
ll fa[400040],tot[400040],sum[400040],lz[400040],siz[400040],top[400040];
struct node{
	ll nxt,to;
}e[800080];
void add(ll u,ll v){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
ll find(ll x){
	if(x==fa[x]) return x;
	ll tmp=find(fa[x]);
	if(fa[x]!=tmp) lz[x]+=lz[fa[x]];
	return fa[x]=tmp;
}
void dfs(ll faa,ll u){
	f[u]=faa;
	dep[u]=dep[faa]+1;
	go(u){
		ll v=e[i].to;
		if(v==faa) continue;
		dfs(u,v);
	}
}
ll calc(ll x){
	find(x);
	return lz[x]+lz[fa[x]];
}
void merge(ll x,ll y){
	x=find(x);
	y=find(y);
	if(siz[x]<siz[y]) swap(x,y);
	fa[y]=x;
	siz[x]+=siz[y];
	if(dep[top[x]]>dep[top[y]]) top[x]=top[y];
	lz[y]-=lz[x];
}
int main(){
	n=read();
	fr(i,1,n-1){
		ll u=read(),v=read();
		d[u]++;
		d[v]++;
		add(u,n+i);
		add(n+i,u);
		add(n+i,v);
		add(v,n+i);
	}
	dfs(0,1);
	fr(i,1,2*n-1) fa[i]=i;
	fr(i,1,2*n-1) siz[i]=1;
	fr(i,1,2*n-1) top[i]=f[i];
	fr(u,n+1,2*n-1){
		tot[u]=2;
		go(u){
			ll v=e[i].to;
			sum[u]+=d[v];
		}
	}
	fr(i,1,n) ans+=d[i]*(d[i]-1);
	fr(u,1,n){
		writeln(ans);
		ll all=0,nsum=0,tp=f[u],oth=0;
		go(u){
			ll v=find(e[i].to);
			all+=tot[v]-1;
			if(dep[tp]>dep[top[v]]) tp=top[v];
		}
		ans-=all*(all-1);
		go(u){
			ll v=find(e[i].to),tmp=all-tot[v]+1,sumv=sum[v];
			if(top[v]){
				sumv+=tg[top[v]];
				if(f[top[v]]) sumv+=calc(f[top[v]]);
			}
			if(top[v]==tp){
				oth=tmp;
				if(top[v]) nsum-=tg[top[v]];
				if(f[top[v]]) nsum-=calc(f[top[v]]);
			}
			nsum+=sumv-all-tot[v]+1;
			nsum+=(tot[v]-1)*tmp;
			ans+=((tmp-1)*(tmp-1)-(tmp-1))*(tot[v]-1);
			ans+=2*(tmp-1)*(sumv-all);
		}
		go(u){
			ll v=find(e[i].to),tmp=all-tot[v]+1;
			lz[v]+=tmp-1;
		}
		go(u) merge(u,e[i].to);
		ll fu=find(u);
		tot[fu]=all;
		sum[fu]=nsum;
		if(top[fu]){
			tg[top[fu]]+=oth-1;
			sum[fu]-=oth-1;
			if(f[top[fu]]) sum[find(f[top[fu]])]+=oth-1;
		}
	}
}