#include <iostream>
#include <limits.h>
#include <cmath>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <fstream>
#include <list>
#include <queue>
#include <iomanip>
#include <deque>
#include <set>

using namespace std;

#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.14159265
#define nmax 50005
#define inf (1<<30)

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,inq[nmax];
int dist[nmax];
vector< pair<int,int> > v[nmax];
queue<int> q;

void Dijkstra()
{
    for(int i = 2; i <= n; i++)
        dist[i] = inf;

    q.push(1);
    dist[1] = 0;

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        inq[nod] = 0;

        vector< pair<int,int> >::iterator it;

        for(int i = 0; i < v[nod].size(); i++)
            if(dist[nod] + v[nod][i].ss < dist[ v[nod][i].ff ])
            {
                dist[ v[nod][i].ff ] = dist[nod] + v[nod][i].ss;
                if(!inq[ v[nod][i].ff ] )
                {
                    q.push(v[nod][i].ff);
                    inq[v[nod][i].ff] = 1;
                }
            }
    }
}

int main()
{

    f >> n >> m;

    for(int i = 1; i <= m; i++)
        {
            int x,y,z;
            f >> x >> y >> z;
            v[x].pb(mp(y,z));
        }

    Dijkstra();

    for(int i = 2; i <= n; i++)
        if(dist[i] != inf)
            g<<dist[i]<<" ";
        else
            g<<0<<" ";
}