#include <queue>
#include <vector>
#include <cstdio>
#define nmax 50001
#define inf 1<<30
using namespace std;
FILE *f=fopen("dijkstra.in","r"),*g=fopen("dijkstra.out","w");
int n,d[nmax];
struct cmp{
    int operator()(int x, int y)
    {
        return d[x]>d[y];
    }
};
struct muc{
    int c,d;
};
vector <muc> l[nmax];
priority_queue <int,vector <int>,cmp> q;
int main()
{
    int i,j,m,x,y; muc aux;
    fscanf(f,"%d %d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d %d %d",&x,&y,&aux.c);
        aux.d=y;
        l[x].push_back(aux);
        aux.d=x;
        l[y].push_back(aux);
    }
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0;
    q.push(1);
    while(!q.empty())
    {
        x=q.top();
        q.pop();
        for(i=0;i<l[x].size();i++)
            if(d[l[x][i].d]>d[x]+l[x][i].c)
        {
            d[l[x][i].d]=d[x]+l[x][i].c;
            q.push(l[x][i].d);
        }
    }
    for(i=2;i<=n;i++)
        fprintf(g,"%d ",d[i]);
    fclose(f);
    fclose(g);
    return 0;
}