#include <iostream>
#include <fstream>
#include <queue>
#include <string.h>

#define pb push_back
#define mp make_pair

using namespace std;

typedef pair <int, int> Pair;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int inf = 0x3f3f3f3f;
const int maxn = 5005;

vector <Pair> v[maxn];
queue <int> q;
int d[maxn];
int n,m;

void dijsktra()
{
    q.push(1);
    d[1] = 0;
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();

        for(int i=0; i<v[nod].size(); ++i)
            if(d[v[nod][i].first] > d[i] + d[v[nod][i].second])
            {
                d[v[nod][i].first] = d[i] + d[v[nod][i].second];
                q.push(v[nod][i].first);

            }
    }

}

int main()
{
    int a,b,c;
    fin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        fin>>a>>b>>c;
        v[a].pb(mp(b,c));
    }
    memset(d, inf, sizeof d);

    dijsktra();
    for(int i=2;i<=n;++i)
        fout<<(d[i] != inf ? d[i] : 0)<<' ';

    return 0;
}