#include <bits/stdc++.h>

using namespace std;

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

vector<pair<int,int>> v[100000];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> h;

int n,m,d[100005],w[100005];

int main() {
    int a,b,c,nod,i;
    f>>n>>m;
    for (i=1;i<=m;i++) {
        f>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
    }
    for (i=2;i<=n;i++)
        d[i]=200000000;
    h.push(make_pair(0,1));
    d[1]=0;
    while (!h.empty()){
        nod=h.top().second;
        h.pop();
        if (w[nod]==0)
            for (i=0;i<v[nod].size();i++)
                if(d[nod]+v[nod][i].first<d[v[nod][i].second]) {
                    d[v[nod][i].second]=d[nod]+v[nod][i].first;
                    h.push(make_pair(d[v[nod][i].second],v[nod][i].second));
                }
        w[nod]=1;
    }
    for (i=2;i<=n;i++)
        if (d[i]==200000000) g<<"0 ";
        else g<<d[i]<<' ';
    return 0;
}