#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
# define inf 0x7fffffff
using namespace std;

struct muchie
{
    int x;
    int c;
};

int m,n;
int d[50010];
vector <muchie> g[50010];

struct cmp
{
    bool operator()(int a, int b)
    {
        return d[a]>d[b];
    }
};

priority_queue <int, vector<int>, cmp> q;

void citire()
{
    freopen("dijkstra.in","r",stdin);
    scanf("%d %d",&n,&m);
    for(int i=2;i<=n;i++)
        d[i]=inf;
    for(int i=0;i<m;i++)
    {
        int x;
        muchie aux;
        scanf("%d %d %d",&x,&aux.x,&aux.c);
        g[x].push_back(aux);
    }

}

void dijkstra()
{
    q.push(1);
    while(!q.empty())
    {
        int t=q.top();
        q.pop();
        for(int i=0;i<g[t].size();i++)
            if(d[g[t][i].x]>d[t]+g[t][i].c)
            {
                d[g[t][i].x]=d[t]+g[t][i].c;
                q.push(g[t][i].x);
            }

    }
}


int main()
{
    citire();
    dijkstra();
    freopen("dijkstra.out","w",stdout);
    for(int i=2;i<=n;i++)
        if(d[i]<inf)
            printf("%d ",d[i]);
        else
            printf("0 ");

    return 0;
}