#include <cstdio>
#define MAXINT 0x7FFFFFFF
# include <queue>
# include <vector>
using namespace std;

vector < pair <int, int> > v[50010];
int i,n,m,x,y,z,nod,d[50010];
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,&z);
        v[x].push_back(make_pair(z,y));
    }
    for (i=1; i<=n; i++)
        d[i]=MAXINT;

    q.push(1);
    d[1]=0;

    while (!q.empty())
    {
        nod=q.top();
        q.pop();
        for (i=0; i<v[nod].size(); i++)
            if (v[nod][i].first+d[nod]<d[v[nod][i].second])
            {
                d[v[nod][i].second]=v[nod][i].first+d[nod];
                q.push(v[nod][i].second);
            }
    }
    for (i=2; i<=n; i++)
    if (d[i]!=MAXINT)
         printf("%d ",d[i]);
        else
        printf("%d ",0);
    printf("\n");
    return 0;
}