import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        int m, n, i, j, w;

        try {
            Scanner reader = new Scanner(new FileInputStream("dijkstra.in"));
            PrintWriter writer = new PrintWriter("dijkstra.out");
            n = reader.nextInt();
            m = reader.nextInt();
            PriorityQueue<Node> priorityQueue = new PriorityQueue<>(new DistanceComparator());
            Node[] nodeArray = new Node[n + 1];

            nodeArray[1] = new Node(1, 0);

            for (int k = 2; k <= n; k++) {
                nodeArray[k] = new Node(k, Integer.MAX_VALUE/2);
                }

            for (int k = 0; k < m; k++) {
                i = reader.nextInt();
                j = reader.nextInt();
                w = reader.nextInt();
                nodeArray[i].addEdge(new Edge(nodeArray[j], w));
            }
            for (int k = 1; k <= n; k++) {
                priorityQueue.add(nodeArray[k]);
            }
            reader.close();

            Node node;
            int tmp;

            while (!priorityQueue.isEmpty()) {
                node = priorityQueue.poll();
                int id = node.id,d;
                //for (i = 1; i <= n; i++) {
                  for (Edge ed : nodeArray[id].edgeArray){
                      if(!priorityQueue.contains(ed.target))
                          continue;
                        d = ed.weight;
                        tmp = nodeArray[id].distance + nodeArray[id].getDistanceTo(ed.target);
                        if (tmp <  ed.target.distance) {
                            ed.target.distance = tmp;
                            priorityQueue.remove(ed.target);
                            ed.target.distance=ed.target.distance;
                            priorityQueue.add(ed.target);
                        }
                }
            }

            int d;

            for (i = 2; i <= n; i++) {
                d = nodeArray[i].distance;
                if (d < Integer.MAX_VALUE/2-1) {
                    writer.write(String.valueOf(d) + ((i != n) ? " " : ""));
                } else {
                    writer.write(String.valueOf(0) + ((i != n) ? " " : ""));
                }
            }
            writer.close();

        } catch(Exception e) {

        }
    }

    private static class Node {
        public int id, distance;
        public ArrayList<Edge> edgeArray = new ArrayList<Edge>();

        public Node(int _id, int _distance) {
            id = _id;
            distance = _distance;
        }

        public void addEdge(Edge e) {
            edgeArray.add(e);
        }

        public int getDistanceTo(Node n) {
            Iterator it = edgeArray.iterator();

            while(it.hasNext()) {
                Edge e = (Edge) it.next();
                if(e.target.equals(n)) {
                    return e.weight;
                }
            }

            return 0;
        }

        @Override
        public boolean equals(Object o) {
            Node node = (Node) o;
            return this.id == node.id;
        }
    }

    public static class Edge {
        public Node target;
        public int weight;

        public Edge(Node _target, int _weight) {
            target = _target;
            weight = _weight;
        }


        @Override
        public boolean equals(Object o) {
            Edge e = (Edge) o;
            return e.target.equals(this.target);
        }
    }

    private static class DistanceComparator implements Comparator<Node> {
        @Override
        public int compare(Node a, Node b) {
            return a.distance >= b.distance ? 1 : -1;
        }
    }

}