import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStream;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;

public class Main {
	 static ArrayList<Pair<Integer, Integer>> [] adj;
	 static int[] dist;

	 
	public static void main(String[] args) throws IOException {
		 BufferedReader bf = new BufferedReader(new FileReader("bellmanford.in"));
		 //PrintStream out = new PrintStream();
		 OutputStream out = new BufferedOutputStream ( new FileOutputStream("bellmanford.out") );
	     String tmp[] = bf.readLine().split(" ");
	     int n = Integer.parseInt(tmp[0]);
	     int m = Integer.parseInt(tmp[1]);
	   
		 Queue<Pair<Integer, Integer> >  q = new LinkedList<Pair<Integer, Integer>>();
		 dist = new int[n+1];
		 adj = new ArrayList[n+1];
		 for(int i=1; i<=n; i++) {
			 adj[i] = new ArrayList<Pair<Integer, Integer> >();
			 dist[i] = Integer.MAX_VALUE;
		 }
		 dist[1] = 0;
		int x,y,d;
	     for (int i = 0; i < m; i++) {
           tmp = bf.readLine().split(" ");
            x = Integer.parseInt(tmp[0]);
            y = Integer.parseInt(tmp[1]);
            d = Integer.parseInt(tmp[2]);
           adj[x].add(new Pair<Integer, Integer>(y, d));
           if (x == 1) {
        	   q.add(new Pair<Integer, Integer>(y, d));
        	   dist[y] = d;
           }   
	     }
	    int [] visited = new int[n+1];
	    boolean ok = true;
	    while (q.isEmpty() == false){
	    	Pair <Integer, Integer> u = q.poll();
	    	for (Pair<Integer, Integer> v : adj[u.x]){
	    		if (dist[u.x] < Integer.MAX_VALUE && 
	    				dist[u.x] + v.y < Integer.MAX_VALUE && (dist[v.x] > dist[u.x] + v.y)){
	    			if (v.x >= n){
	    				out.write(("Ciclu negativ!").getBytes());
		    		    ok = false;
		    		    break;
	    			}
	    			dist[v.x] = dist[u.x] + v.y;
	    			if (q.contains(v))
	    				q.remove(v);
	    			q.add(new Pair<Integer, Integer>(v.x, dist[v.x]));	
	    			visited[v.x]++;
	    		}
	    	if (!ok)
	    		break;
	    	}
	    }
	    
	    if (ok){		 
		    for (int i = 2 ;i <= n;i++)
		    		out.write((dist[i]+" ").getBytes());
	    }
	    out.write(("\n").getBytes());
		 out.flush();
		 out.close();
		 bf.close();
		 
	}
}

	class Pair <A,B>{
		A x;
		B y;
		public Pair(A x, B y) {
			super();
			this.x = x;
			this.y = y;
		}
	}