#include <bits/stdc++.h>
#define MAX 50010
#define INF 5000000002
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m;
int d[MAX];
bool uz[MAX];
struct nod
{
    int y,c;
};
vector <nod>g[MAX];

struct compara
{
    bool operator()(int x, int y)
    {
        return d[x] > d[y];
    }
};

priority_queue<int, vector<int> > Coada;
void citire();
void dijkstra(int node);
void afisare();
int main()
{
    citire();
    dijkstra(1);
    afisare();
}
void citire()
{
    int i,x,y,cost;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        g[x].push_back({y,cost});
    }
}
void dijkstra(int node)
{
    int i,nodecrt,vecin,cost;
    for(i=1;i<=n;i++)
        d[i]=INF;
    d[node]=0;
    Coada.push(node);
    uz[node] = 1;
    while(!Coada.empty())
    {
        nodecrt = Coada.top();
        Coada.pop();
        uz[nodecrt]=0;
        for(i=0;i<g[nodecrt].size(); i++)
        {
            vecin = g[nodecrt][i].y;
            cost = g[nodecrt][i].c;
            if(d[nodecrt] + cost < d[vecin])
            {
                d[vecin] = d[nodecrt] + cost;
                if(!uz[vecin])
                {
                    Coada.push(vecin);
                    uz[vecin]=1;
                }
            }
        }
    }
}
void afisare()
{
    int i;
    for(i=1;i<=n;i++)
    {
        if(d[i]!=INF)
            fout<<d[i]<<' ';
        else
            fout<<0;
    }
}