#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
#define Max 50001
#define Inf 0xfffff

int n,m,d[Max];
vector<pair<int,int> >g[Max];
set<int>s;

void dijkstra(){
    int x,y;
    for(int i=2;i<=n;i++)d[i] = Inf;
    s.insert(1);

    while(s.size()>0)
    {
        x = *s.begin(); s.erase(s.begin());
        for(int i=0;i<g[x].size();i++)
        {
            y = g[x][i].first;
            if( d[y] > d[x] + g[x][i].second )
            {
                d[y] = d[x] + g[x][i].second;
                s.insert(y);
            }
        }
    }
}

int main(){
    int a,b,c;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

        scanf("%d %d",&n,&m);

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

    dijkstra();

        for(int i=2;i<=n;i++)
        if( d[i] == Inf )printf("0 "); else printf("%d ",d[i]);
        printf("\n");

    return 0;
}