/// Algoritmul lui Pepe

#include <iostream>
#include <cstdio>
#include <vector>
#include <deque>

using namespace std;

const int N=50000+7;
const int inf=(int)1e9;
int n,m;

struct edge
{
        int to;
        int cost;
};

vector <edge> g[N];
int d[N];
int mt[N];

int main()
{
        freopen("dijkstra.in","r",stdin);
        freopen("dijkstra.out","w",stdout);

        scanf("%d%d",&n,&m);
        for(int i=2;i<=n;i++)
                d[i]=inf;
        for(int i=1;i<=m;i++)
        {
                int a,b,c;
                scanf("%d%d%d",&a,&b,&c);
                g[a].push_back({b,c});
        }

        for(int j=1;j<=n;j++)
                mt[j]=2;

        deque <int> dq;
        dq.push_back(1);
        while(!dq.empty())
        {
                int nod=dq.front();
                dq.pop_front();
                mt[nod]=0;
                for(auto &e : g[nod])
                        if(d[e.to]>d[nod]+e.cost)
                        {
                                d[e.to]=d[nod]+e.cost;
                                if(mt[e.to]==2)
                                        dq.push_back(e.to);
                                if(mt[e.to]==0)
                                        dq.push_front(e.to);
                                mt[e.to]=1;
                        }
        }

        for(int i=2;i<=n;i++)
        {
                if(d[i]==inf)
                        d[i]=0;
                printf("%d ", d[i]);
        }
        printf("\n");

        return 0;
}