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

data class Edge(val node: Int, val cost: Long)
data class State(val cost: Long, val position: Int, val prenode: Int) : Comparable<State> {
    override fun compareTo(other: State): Int {
        return if (cost == other.cost) position.compareTo(other.position) else cost.compareTo(other.cost)
    }
}

fun dijkstra(adj: Array<MutableList<Edge>>, start: Int): LongArray {
    val n = adj.count()
    val dist = LongArray(n) { Long.MAX_VALUE }
    val preNodes = IntArray(n) { it }
    val heap = PriorityQueue<State>()
    dist[start] = 0
    heap.add(State(0, start, 0))
    while (heap.isNotEmpty()) {
        val state = heap.poll()
        val (cost, position, prenode) = state
        if (cost > dist[position]) continue
        preNodes[position] = prenode
        for (edge in adj[position]) {
            val next = State(cost + edge.cost, edge.node, position)
            if (next.cost < dist[next.position]) {
                heap.add(next)
                dist[next.position] = next.cost
            }
        }
    }
    return dist
}

fun PrintWriter.solve() {
    val n = nextInt()
    val m = nextInt()
    val adj = Array(2 * n) { mutableListOf<Edge>() }
    for (i in 0 until m) {
        val a = nextInt() - 1
        val b = nextInt() - 1
        val c = nextLong()
        val x = nextInt()
        if (x == 0) {
            adj[a].add(Edge(b, c))
            adj[b].add(Edge(a, c))
            adj[a + n].add(Edge(b + n, c))
            adj[b + n].add(Edge(a + n, c))
        } else {
            adj[a].add(Edge(b + n, c))
            adj[b].add(Edge(a + n, c))
            adj[a + n].add(Edge(b + n, c))
            adj[b + n].add(Edge(a + n, c))
        }
    }
    val result = dijkstra(adj, n - 1)
    println(result.slice(n until 2 * n - 1).joinToString("\n"))
}

// region ModInt
class ModInt(x: Long) {
    companion object {
        const val MOD = 1000000007L
        //const val MOD = 998244353L
    }

    constructor(y: Int) : this(y.toLong())

    val x = (x % MOD + MOD) % MOD

    operator fun plus(other: ModInt): ModInt {
        return ModInt(x + other.x)
    }

    operator fun minus(other: ModInt): ModInt {
        return ModInt(x - other.x)
    }

    operator fun times(other: ModInt): ModInt {
        return ModInt(x * other.x)
    }

    operator fun div(other: ModInt): ModInt {
        return this * other.inv()
    }

    fun pow(exp: Long): ModInt {
        if (exp == 0L) return ModInt(1L)
        var a = pow(exp shr 1)
        a *= a
        if (exp and 1L == 0L) return a
        return this * a
    }

    fun inv(): ModInt {
        return this.pow(MOD - 2)
    }

    override fun equals(other: Any?): Boolean {
        if (this === other) return true
        if (javaClass != other?.javaClass) return false

        other as ModInt

        if (x != other.x) return false

        return true
    }

    override fun hashCode(): Int {
        return x.hashCode()
    }

    override fun toString(): String {
        return "$x"
    }
}

fun Long.toModInt(): ModInt {
    return ModInt(this)
}

fun Int.toModInt(): ModInt {
    return ModInt(this)
}

fun binomSimple(n: Long, k: Long): ModInt {
    var numer = ModInt(1)
    var denom = ModInt(1)
    for (i in 0 until k) {
        numer *= ModInt(n - i)
        denom *= ModInt(k - i)
    }
    return numer / denom
}
// endregion

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

// 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