import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); ArrayList> withGraph = new ArrayList<>(); ArrayList> withoutGraph = new ArrayList<>(); for (int i = 0; i < n; i++) { withGraph.add(new HashMap<>()); withoutGraph.add(new HashMap<>()); } for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); int x = sc.nextInt(); if (x == 0) { withoutGraph.get(a).put(b, c); withoutGraph.get(b).put(a, c); } else { withGraph.get(a).put(b, c); withGraph.get(b).put(a, c); } } PriorityQueue queue = new PriorityQueue<>(); queue.add(new Path(n - 1, 0, 0)); long[][] costs = new long[2][n]; Arrays.fill(costs[0], Long.MAX_VALUE); Arrays.fill(costs[1], Long.MAX_VALUE); while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.type][p.idx] <= p.value) { continue; } costs[p.type][p.idx] = p.value; for (int x : withGraph.get(p.idx).keySet()) { queue.add(new Path(x, 1, p.value + withGraph.get(p.idx).get(x))); } for (int x : withoutGraph.get(p.idx).keySet()) { queue.add(new Path(x, p.type, p.value + withoutGraph.get(p.idx).get(x))); } } StringBuilder sb = new StringBuilder(); for (int i = 0; i < n - 1; i++) { sb.append(costs[1][i]).append("\n"); } System.out.print(sb); } static class Path implements Comparable { int idx; int type; long value; public Path(int idx, int type, long value) { this.idx = idx; this.type = type; this.value = value; } public int compareTo(Path another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } } class Combination { static final int MOD = 1000000007; long[] fac; long[] finv; long[] inv; public Combination (int size) { fac = new long [size]; finv = new long [size]; inv = new long [size]; fac[0] = 1; fac[1] = 1; finv[0] = 1; finv[1] = 1; inv[1] = 1; for (int i = 2; i < size; i++) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } public long getComb(int n, int k) { if (n < k || n < 0 || k < 0) { return 0; } return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }