#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define INF 0x3f3f3f3f
#define NMAX 50005
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m;
vector <pair<int,int> > G[NMAX];
int dmin[NMAX];
void citire()
{
    int a,b,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        G[a].push_back(make_pair(b,c));
    }
}
void prog()
{
    bool in[NMAX];
    int nod;
    queue <int> Q;
    memset(dmin, INF, sizeof(dmin));
    memset(in, false, sizeof(in));
    dmin[1]=0;
    in[1]=true;
    Q.push(1);
    while(!Q.empty())
    {
        nod=Q.front();
        in[nod]=false;
        Q.pop();
        for(vector<pair<int,int> >::iterator it=G[nod].begin(); it!=G[nod].end(); ++it)
            if(dmin[nod]+it->second < dmin[it->first])
            {
                dmin[it->first]=dmin[nod]+it->second;
                if(!in[it->first])
                {
                    Q.push(it->first);
                    in[it->first]=true;
                }
            }
    }

}
int main()
{
    citire();
    prog();
    for (int i = 2; i <= n; ++i)
        fout << (dmin[i] < INF ? dmin[i] : 0) << " ";
}