#include <fstream>
#include <vector>
#include <utility>

using namespace std;

struct W{
    int x, y, w;
    W(int x, int y, int w) {
        this->x=x;
        this->y=y;
        this->w=w;
    }
};

int main () {
    int n, m, x, y, z;
    vector<W> w;
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    fin>>n>>m;    
    for(int i=0;i<m;i++) {
        fin>>x>>y>>z;
        w.push_back(W(x,y,z));
    }

    vector<int> distance(n+1);
    for(int i=1;i<=n;i++) {
        distance[i]=0x3f3f3f3f;
    }
    distance[1]=0;
    bool change=true; 
    while(change) {
        change=false;
        for(auto& e: w) {
            if(distance[e.y] > distance[e.x] + e.w) {
                change=true;
                distance[e.y] = distance[e.x] + e.w; 
            }
        }
    }
    for(int i=2;i<=n;i++) {
        if(distance[i]==0x3f3f3f3f) {
            fout<<0<<" ";
        }
        else {
            fout<<distance[i]<<" ";
        }
    }

    return 0;
}