#include <cstdio>
#include <queue>
using namespace std;
int n,m,x,y,c,start=1,d[50001],minn,MAXX=10000000;
struct muchie
{
    int x,y;
}__attribute__((packed));
queue<muchie>q;
vector<muchie>m1[50001];
int main()
{
    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",&x,&y,&c);
        m1[x].push_back({y,c});
    }
    for(int i=1; i<=n; i++)
        d[i]=MAXX;
    d[start]=0;
    q.push({0,start});
    while(q.size())
    {
        x=q.front().y;
        q.pop();
        for(int i=0; i<m1[x].size(); i++)
        {
            y=m1[x][i].x;
            c=m1[x][i].y;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                q.push({d[y],y});
            }
        }
    }
    for(int i=2; i<=n; i++)
        if(d[i]!=MAXX)
            printf("%d ",d[i]);
        else printf("0 ");
    return 0;
}