#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int nmax=50000;
const int oo=1e9;
vector <pair <int,int>> g[nmax+5];
int d[nmax+5];
bool use[nmax+5];
int n,m;
priority_queue <pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;
void citire()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
}
int findmin()
{
    while(use[q.top().second])
        q.pop();
    int minim=q.top().second; q.pop();
    return minim;
}
void dijkstra()
{
    for(int i=2;i<=n;i++)
        d[i]=oo;
    for(int i=1;i<=n;i++)
        q.push(make_pair(d[i],i));
    for(int i=1;i<=n;i++)
        {int nod;
        nod=findmin();
        use[nod]=true;
        for(auto j:g[nod])
        {
            int vec=j.first,dist=j.second;
            if(d[vec]>d[nod]+dist)
                {d[vec]=min(d[vec],d[nod]+dist);
                q.push(make_pair(d[vec],vec));}
        }
        }
}
void af()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]==oo)
            fout<<"0";
        else
            fout<<d[i]<<" ";
    }
}
int main()
{
    citire();
    dijkstra();
    af();
    return 0;
}