#include<iostream>
#include<fstream>
#include<stdio.h>
#define maxx 2000000000
#define nmax 50003
#include<queue>
#include<vector>
using namespace std;
struct road
{
    int d;
    int l;
};
vector<road> v[nmax];
queue<int> poz;
int f[nmax];
void dij()
{
    int i,x,n;
    while(poz.size()>0)
    {
        x=poz.front();
        poz.pop();
        n=v[x].size();
        for(i=0;i<n;++i)
        {
            if(f[v[x][i].d]>f[x]+v[x][i].l)
            {
                f[v[x][i].d]=f[x]+v[x][i].l;
                poz.push(v[x][i].d);
            }
        }
    }
}
int main()
{
    ifstream si;
    si.open("dijkstra.in");
    FILE* so=fopen("dijkstra.out","w");
    int n,m;
    si>>n>>m;
    int a,b,i,c;
    road r;
    for(i=0;i<m;++i)
    {
        si>>a>>b>>c;
        --a;
        --b;
        r.d=b;
        r.l=c;
        v[a].push_back(r);
        r.d=a;
    //    v[b].push_back(r);
    }
    for(i=1;i<n;++i)
        f[i]=maxx;
    poz.push(0);
    dij();
    for(i=1;i<n;++i)
        if(f[i]==maxx)
            fprintf(so,"0 ");
        else
            fprintf(so,"%i ",f[i]);

}