#include<iostream>
#include<fstream>
#include<utility>
#include<vector>
#define NMAX 50002
#include<set>
#define inf 100000
#include<cstring>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,dmin[NMAX],nod;
vector<pair<int,int> >g[NMAX];
set<pair<int,int> > st;
void read()
{
    fin>>n>>m;
    int x,y,c;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));

    }
    fin.close();
}
int main()
{
    read();
    for(int i=1;i<=n;i++)dmin[i]=inf;
    dmin[1]=0;

    st.insert(make_pair(0,1));
    while(!st.empty())
    {
        nod=st.begin()->second;

        st.erase(st.begin());
        for(int i=0;i<g[nod].size();++i)
        {
            if(dmin[g[nod][i].first]>dmin[nod]+g[nod][i].second)
            {
                dmin[g[nod][i].first]=dmin[nod]+g[nod][i].second;
                st.insert(make_pair(dmin[g[nod][i].first],g[nod][i].first));
            }
        }
}
for(int i=2;i<=n;i++)
     if(dmin[i]==inf)fout<<0<<" ";
else fout<<dmin[i]<<" ";
fout.close();



    return 0;
}