import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    val adj = Array(n) { mutableListOf<Int>() }
    for (i in 0 until n - 1) {
        val v1 = nextInt() - 1
        val v2 = nextInt() - 1
        adj[v1].add(v2)
        adj[v2].add(v1)
    }
    val ans = Array(n) { 0 }
    val stack = Stack<Pair<Int, Int>>()
    stack.push(0 to -1)
    while (stack.isNotEmpty()) {
        val (v, p) = stack.pop()
        for (w in adj[v]) {
            if (w != p) {
                stack.push(w to v)
                if (w < v) ans[0]++
            }
        }
    }
    stack.push(0 to -1)
    while (stack.isNotEmpty()) {
        val (v, p) = stack.pop()
        if (p != -1) {
            ans[v] = ans[p] + if (v > p) 1 else -1
        }
        for (w in adj[v]) {
            if (w != p) {
                stack.push(w to v)
            }
        }
    }
    println(ans.joinToString("\n"))
}

fun main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", abs(1L.shl(26)))
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()
}

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

fun next(): String {
    while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())
    return st.nextToken()
}

fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()
fun nextDouble() = next().toDouble()
// endregion