import java.util.*;

public class Main {
	public static void main (String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int n = sc.nextInt();
    	int m = sc.nextInt();
    	ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>();
    	for (int i = 0; i < n; i++) {
    	    graph.add(new HashMap<>());
    	}
    	for (int i = 0; i < m; i++) {
    	    int a = sc.nextInt() - 1;
    	    int b = sc.nextInt() - 1;
    	    int c = sc.nextInt();
    	    graph.get(a).put(b, c);
    	    graph.get(b).put(a, c);
    	}
    	PriorityQueue<Path> queue = new PriorityQueue<>();
    	queue.add(new Path(0, 0, 0));
    	queue.add(new Path(0, 1, 0));
    	long[][] costs = new long[2][n];
    	for (long[] arr : costs) {
    	    Arrays.fill(arr, 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 : graph.get(p.idx).keySet()) {
    	        queue.add(new Path(x, p.type, p.value + graph.get(p.idx).get(x)));
    	        if (p.type == 0) {
    	            queue.add(new Path(x, 1, p.value));
    	        }
    	    }
    	}
    	StringBuilder sb = new StringBuilder();
    	for (int i = 0; i < n; i++) {
    	    sb.append(costs[0][i] + costs[1][i]).append("\n");
    	}
    	System.out.print(sb);
	}
	
	static class Path implements Comparable<Path> {
	    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;
	        }
	    }
	}
}