import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); List> graph = new ArrayList<>(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); } int m = sc.nextInt(); for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); graph.get(a).add(new Path(0, b, c)); graph.get(b).add(new Path(0, a, c)); } PriorityQueue queue = new PriorityQueue<>(); queue.add(new Path(0, 0, 0)); long[][] costs = new long[2][n]; for (long[] arr : costs) { Arrays.fill(arr, Long.MAX_VALUE); } costs[1][0] = 0; 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 (Path x : graph.get(p.idx)) { queue.add(new Path(p.type, x.idx, p.value + x.value)); if (p.type == 0) { queue.add(new Path(1, x.idx, p.value)); } } } String result = IntStream.range(0, n) .mapToObj(i -> String.valueOf(costs[0][i] + costs[1][i])) .collect(Collectors.joining("\n")); System.out.println(result); } static class Path implements Comparable { int type; int idx; long value; public Path(int type, int idx, long value) { this.idx = idx; this.type = type; this.value = value; } public int compareTo(Path another) { return Long.compare(value, another.value); } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }