#include <cstdio>
#include <vector>
#include <set>
#define INF 999999999
using namespace std;
int n,m,i,x,y,c,d[50005],crt,node;
vector < pair <int,int> > G[50005];
set < pair <int,int> > H;
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        G[x].push_back(make_pair(y,c));
    }
    for (i=1; i<=n; i++) d[i]=INF;
    d[1]=0;
    H.insert(make_pair(1,0));
    while (!H.empty())
    {
        crt=H.begin()->first;
        H.erase(H.begin());
        for (i=0; i<G[crt].size(); i++)
        {
            node=G[crt][i].first;
            if (d[crt]+G[crt][i].second<d[node])
            {
                if (d[node]!=INF) H.erase(H.find(make_pair(node,d[node])));
                d[node]=d[crt]+G[crt][i].second;
                H.insert(make_pair(node,d[node]));
            }
        }
    }
    for (i=2; i<=n; i++)
    {
        if (d[i]==INF) d[i]=0;
        printf("%d ",d[i]);
    }
    return 0;
}