#include<cstdio>
#include<cstdlib>
#define MAX_N 50000
#define oo 2000000000
using namespace std;

struct Node
{
    int val, cost;
    Node* next;
};

int d[MAX_N+1], h[MAX_N+1], pos[MAX_N+1], n, m, k;
Node* L[MAX_N + 1];

inline void insertBack(int x, int y, int c)
{
    Node* elem = (Node*)malloc(sizeof(Node));
    elem->val = y;
    elem->cost = c;
    elem->next = L[x];
    L[x] = elem;
}

inline void Swap(int i, int j)
{
    int tmp;
    tmp = h[i];
    h[i] = h[j];
    h[j] = tmp;
    tmp = pos[h[i]];
    pos[h[i]] = pos[h[j]];
    pos[h[j]] = tmp;
}

void heapDown(int i)
{
    int l, r;
    if(2*i > k) return;
    l = d[h[2*i]];
    if(2*i + 1 <= k)
        r = d[h[2*i+1]];
    else r = l + 1;
    if(l < r)
    {
        if(d[h[i]] <= l) return;
        Swap(i,2*i);
        heapDown(2*i);
    }
    else
    {
        if(d[h[i]] <= r) return;
        Swap(i,2*i+1);
        heapDown(2*i+1);
    }
}

void heapUp(int i)
{
    if(d[h[i/2]] <= d[h[i]]) return;
    Swap(i,i/2);
    heapUp(i/2);
}

void Dijkstra(int x)
{
    int i, node;
    Node* p;
    for(i=1; i<=n; i++)
    {
        d[i] = oo;
        h[i] = i;
        pos[i] = i;
    }
    k = n;
    d[1] = 0;
    for(i=1; i<=n; i++)
    {
        node = h[1];
        Swap(1,k);
        k--;
        heapDown(1);
        p = L[node];
        while(p != NULL)
        {
            if(d[p->val] > d[node] + p->cost)
            {
                d[p->val] = d[node] + p->cost;
                heapUp(pos[p->val]);
            }
            p = p->next;
        }
    }
}

int main()
{
    int i, x, y, c;
    FILE *fin, *fout;
    fin = fopen("dijkstra.in","r");
    fout = fopen("dijkstra.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d%d",&x,&y,&c);
        insertBack(x,y,c);
    }
    Dijkstra(1);
    for(i=2; i<=n; i++)
        if(d[i] != oo)
            fprintf(fout,"%d ",d[i]);
        else fprintf(fout,"0 ");
    fprintf(fout,"\n");
    fclose(fin);
    fclose(fout);
    return 0;
}