#include <cstdio>
#include <vector>
#include <set>
#define INF 0xffffff
using namespace std;

vector<pair<int,int> >g[50005];
set<pair<int,int> >s;
int d[50005],n,m;
bool viz[50005];

void dijkstra(){
    int x,y,c;
    for(int i=2;i<=n;i++) d[i] = INF;
    s.insert( make_pair(0,1) );
    while(s.size() > 0)
    {
        x = s.begin()->second;
        c = s.begin()->first;
        s.erase(s.begin());
        viz[x] = 1;
        for(int i=0;i<g[x].size();i++)
        {
            y = g[x][i].first;
            if(viz[y] == 0 && d[y] > c+g[x][i].second)
            {
                d[y] = c+g[x][i].second;
                s.erase( make_pair(d[y],y) );
                s.insert( make_pair(d[y],y) );
            }
        }
    }
}

int main(){
    int x,y,c;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
        scanf("%d %d",&n,&m);

        for(int i=0;i<m;i++)
        {
            scanf("%d %d %d",&x,&y,&c);
            g[x].push_back( make_pair(y,c) );
        }

    dijkstra();
    for(int i=2;i<=n;i++) printf("%d ",d[i] == INF ? 0 : d[i]);

    return 0;
}