#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

#define x first
#define y second

#define NMAX 50007
#define INF 1 << 29

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

priority_queue < pair < int, int > > q;
vector < pair < int, int > > v[NMAX];
int n, m;
int Dp[NMAX];
bool Viz[NMAX];

void dijkstra(int Start){
    q.push(make_pair(0, Start));
    for(int i = 2; i <= n; ++i)
        Dp[i] = INF;
    while(! q.empty()){
        int Node = q.top().y;
        q.pop();
        if(Viz[Node] == 0){
            Viz[Node] = 1;
            for(vector < pair < int, int > > :: iterator it = v[Node].begin(); it != v[Node].end(); ++it)
                if(Dp[it->x] > Dp[Node] + it->y){
                    Dp[it->x] = Dp[Node] + it->y;
                    q.push(make_pair(-Dp[it->x], it->x));
                    Viz[it->x] = 0;
                }
        }
    }
}

int main(){
    cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int A, B, C;
        cin >> A >> B >> C;
        v[A].push_back(make_pair(B, C));
    }
    dijkstra(1);
    for(int i = 2; i <= n; ++i)
        if(Dp[i] == INF)
            cout << "0 ";
        else
            cout << Dp[i] << " ";
    return 0;
}