import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum INF = 10L^^18; int N, M; int[] A, B; long[] C; void main() { try { for (; ; ) { N = readInt(); M = readInt(); A = new int[M]; B = new int[M]; C = new long[M]; foreach (i; 0 .. M) { A[i] = readInt() - 1; B[i] = readInt() - 1; C[i] = readLong(); } auto graph = new int[][N]; foreach (i; 0 .. M) { graph[A[i]] ~= i; graph[B[i]] ~= i; } alias Node = Tuple!(long, int, int); auto q = BinaryHeap!(Array!Node, "a > b")(); auto dist = new long[][](N, 2); foreach (u; 0 .. N) { dist[u][] = INF; } dist[0][0] = 0; q.insert(Node(0, 0, 0)); for (; !q.empty; ) { const c = q.front[0]; const u = q.front[1]; const x = q.front[2]; q.removeFront; if (dist[u][x] == c) { foreach (i; graph[u]) { const v = A[i] ^ B[i] ^ u; foreach (dx; 0 .. 2) { const xx = x + dx; if (xx < 2) { const cc = c + (dx ? 0 : C[i]); if (chmin(dist[v][xx], cc)) { q.insert(Node(cc, v, xx)); } } } } } } foreach (u; 0 .. N) { writeln(dist[u][0] + min(dist[u][0], dist[u][1])); } } } catch (EOFException e) { } }