#include <fstream>
#include <queue>
#include <vector>
#define INF 8888888
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m;
vector < pair <int,int> > a[50005];
bool viz[50005] = {false};
long long dist[50005];
queue < pair <int,long long> > Q;

void dijkstra(int start) {
    for(int i = 1; i <= n; i++) {
        dist[i] = INF;
    }
    dist[start] = 0;
    //viz[start] = true;
    Q.push(make_pair(start,dist[start]));
    while(!Q.empty()) {
        int nod = Q.front().first;
        long long d = Q.front().second;
        Q.pop();
        if(!viz[nod]) {
            viz[nod] = true;
            for(int i = 0; i < a[nod].size(); i++) {
                int aux = a[nod][i].second + d;
                if(!viz[a[nod][i].first] && aux < dist[a[nod][i].first]) {
                    dist[a[nod][i].first] = aux;
                    Q.push(make_pair(a[nod][i].first,dist[a[nod][i].first]));
                }
            }
        }
    }
}

int main(int argc, char** argv) {
    f >> n >> m;
    int x,y,z;
    for(int i=1;i<=m;i++) {
        f >> x >> y >> z;
        a[x].push_back(make_pair(y,z));
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            g<<0<<" ";
        else
            g<<dist[i]<<" ";
    }
    return 0;
}