import sys
input = lambda : sys.stdin.readline().rstrip()

write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO)
LI = lambda : list(map(int, input().split()))
# sys.setrecursionlimit(3*10**5+10)

### 木の読み込み yomikomi
n = int(input())
ns = [[] for _ in range(n)]
for _ in range(n-1):
    u,v = map(int, input().split())
    u -= 1
    v -= 1
    ns[u].append(v)
    ns[v].append(u)
    
# 深さ優先探索 (巻き戻しあり) dfs tree
q = [(0, -1)]
vs = [0]*n
while q:
    u,prv = q.pop()
    if u<0:
        # 返るときの処理
        u = ~u
        for v in ns[u]:
            if v==prv:
                continue
            pass
    else:
        q.append((~u,prv))
        for v in ns[u]:
            # 進むときの処理
            if v==prv:
                continue
            q.append((v,u))
            if u>v:
                vs[0] += 1
# 深さ優先探索 (巻き戻しあり) dfs tree
# print(vs)
q = [(0, -1)]
while q:
    u,prv = q.pop()
    if u<0:
        # 返るときの処理
        u = ~u
        for v in ns[u]:
            if v==prv:
                continue
            pass
    else:
        q.append((~u,prv))
        for v in ns[u]:
            # 進むときの処理
            if v==prv:
                continue
            q.append((v,u))
            if u>v:
                vs[v] = vs[u] - 1
            else:
                vs[v] = vs[u] + 1
write("\n".join(map(str, vs)))