#include <fstream>
#include <vector>
#include <set>
#define MX 2000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair <int, int> > a[50004];
int n,m,x,y,c,d[50004],p,u;
set < pair <int, int> >s;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        a[x].push_back(make_pair(y,c));
        if(i<=n)
            d[i]=MX;
    }
    d[1]=0;
    s.insert(make_pair(0,1));
    while(s.empty()==false)
    {
        int i=s.begin()->second;
        s.erase(s.begin());
        for(int j=0;j<a[i].size();j++)
        {
            int vecin=a[i][j].first;
            c=a[i][j].second;
            if(d[vecin]>d[i]+c)
            {
                s.erase(make_pair(d[vecin],vecin));
                d[vecin]=d[i]+c;
                s.insert(make_pair(d[vecin],vecin));

            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}