#include <cstdio>
#include <vector>
#include <queue>
#define N 50001
#define INF (1<<30)
using namespace std;
int n,d[N];
struct cmp
{
    bool operator() (const int a,const int b) const
    {
        return d[a]>d[b];
    }
};
vector < pair<int, int> >G[N];
priority_queue <int, vector <int>,cmp>Q;
void citire()
{
    int m,x,y,c;
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        G[x].push_back(make_pair(y,c));
    }
}
void dijkstra(int v)
{
    for(int i=1;i<=n;i++)
    {
        d[i]=INF;
        Q.push(i);
    }
    d[v]=0;
    while(!Q.empty())
    {
        int x=Q.top();
        Q.pop();
        unsigned int m=G[x].size();
        for(unsigned int i=0;i<m;i++)
        {
            int y=G[x][i].first;
            int c=G[x][i].second;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                Q.push(y);
            }
        }
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INF)
            printf("0 ");
        else
            printf("%d ",d[i]);
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    dijkstra(1);
    afisare();
    return 0;
}