#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define MAX 50005
#define INF 0xfffffff

vector<pair<int,int> >g[MAX];
set<pair<int,int> >s;

int n,d[MAX];

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

int main(){
    int m,x,y,c;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
        scanf("%d %d",&n,&m);
        while(m--)
        {
            scanf("%d %d %d",&x,&y,&c);
            g[x].push_back( make_pair(c,y) );
        }
    dijkstra();
    for(int i=2;i<=n;i++)printf("%d ",d[i] == INF ? 0 : d[i]);

    return 0;
}