using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Linq.Expressions;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NArr(m);
        var tree = new List<(int to, long len)>[n * 2];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<(int to, long len)>();
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add((edge[1] - 1, edge[2]));
            tree[edge[1] - 1].Add((edge[0] - 1, edge[2]));
            tree[edge[0] - 1].Add((edge[1] - 1 + n, 0));
            tree[edge[1] - 1].Add((edge[0] - 1 + n, 0));
            tree[edge[0] - 1 + n].Add((edge[1] - 1 + n, edge[2]));
            tree[edge[1] - 1 + n].Add((edge[0] - 1 + n, edge[2]));
        }
        var len = Enumerable.Repeat(long.MaxValue / 2, n * 2).ToArray();
        len[0] = 0;
        var q = new PriorityQueue<(int pos, long len), long>();
        q.Enqueue((0, 0), 0);
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            if (len[cur.pos] != cur.len) continue;
            foreach (var next in tree[cur.pos])
            {
                if (len[next.to] <= cur.len + next.len) continue;
                len[next.to] = cur.len + next.len;
                q.Enqueue((next.to, len[next.to]), len[next.to]);
            }
        }
        var ans = new long[n];
        for (var i = 1; i < n; ++i) ans[i] = len[i] + len[i + n];
        WriteLine(string.Join("\n", ans));
    }
}