#include <bits/stdc++.h>
#define inf 2000000000
using namespace std;
int n,m,d[50003];
bool viz[50003];
vector <pair <int,int>> L[50003];

void Citire()
{
    int x,y,c;
    ifstream fin("dijkstra.in");
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        L[x].push_back({y,c});
    }
    fin.close();
}

void Dijkstra(int start)
{
    int i,x,y,c;
    unsigned int ui;
    priority_queue<pair <int,int>> q;
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[start]=0;
    q.push({0,start});
    while(!q.empty())
    {
        x=q.top().second;
        q.pop();
        if(viz[x]==0)
        {
            viz[x]=1;
            for(ui=0;ui<L[x].size();ui++)
            {
                y=L[x][ui].first;
                c=L[x][ui].second;
                if(d[y]>d[x]+c)
                {
                    d[y]=d[x]+c;
                    q.push({-d[y],y});
                }
            }
        }
    }
}

void Afisare()
{
    ofstream fout("dijkstra.out");
    for(int i=2;i<=n;i++)
        if(d[i]!=inf) fout<<d[i]<<" ";
            else fout<<"0 ";
    fout.close();
}

int main()
{
    Citire();
    Dijkstra(1);
    Afisare();
    return 0;
}