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

#define pb push_back
#define mp make_pair

using namespace std;

typedef pair <int, int> Pair;

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

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n, m;

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

void dijkstra()
{
    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[nod] + v[nod][i].second)
            {
                d[v[nod][i].first] = d[nod] + v[nod][i].second;
                q.push(v[nod][i].first);
            }
    }
}

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

    memset(d, inf, sizeof d);

    dijkstra();

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

    return 0;
}