#include <cstdio>
# include <vector>
# include <queue>
#define MAXINT 0x7FFFFFFF
 
using namespace std;
 
vector < pair <int, int> > v[50010];
int n,m,x,y,c,i,d[50010],nod;
struct comp
{
    bool operator () (const int &X, const int &Y)
    {
        return (d[X]>d[Y]);
    }
};
 
priority_queue <int, vector <int>, comp> q;
 
 
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %d\n",&x,&y,&c);
        v[x].push_back(make_pair(c,y));
    }
    q.push(1);
    for (i=1; i<=n; i++)
        d[i]=MAXINT;
    d[1]=0;
    while(!q.empty())
    {
        nod=q.top();
        q.pop();
        for (i=0; i<v[nod].size(); ++i)
            if (d[v[nod][i].second]>d[nod]+v[nod][i].first)
            {
               d[v[nod][i].second]=d[nod]+v[nod][i].first;
               q.push(v[nod][i].second);
            }
    }
 
    for (i=2; i<=n; i++)
        if (d[i]!=MAXINT)
            printf("%d ",d[i]);
        else printf("0 ");
    printf("\n");
    return 0;
}