#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");


struct Pair
{
    int node, dist;
    bool operator < (const Pair& p) const
    {
        return dist > p.dist;
    }
};

const int Inf = 0x3f3f3f3f;
void ReadGraph();
void Dijkstra(int S, vector<int>& d);

vector<vector<Pair>> G;
vector<int> d;
int n, m;

int main()
{
    ReadGraph();
    Dijkstra(1, d);

    for (int i = 2; i <= n; ++i)
        if ( d[i] != Inf )  fo << d[i] << ' ';
                      else  fo << 0 << ' ';

}

void ReadGraph()
{

    int x, y, w;
    fi >> n >> m;
    G.resize(n + 1);
    while ( m-- )
    {
        fi >> x >> y >> w;
        G[x].push_back({y, w});
      //G[y].push_back({x, w});
    }

}
void Dijkstra(int x, vector<int>& d)
{
    priority_queue<Pair> Q;

    d = vector<int> (n + 1, Inf);
    d[x] = 0;

    for ( Q.push({x, 0}); !Q.empty(); Q.pop() )
    {
             x = Q.top().node;
        int dx = Q.top().dist;

        if ( dx > d[x] ) continue;
        for (auto& p : G[x])
        {
            int y = p.node, w = p.dist;
            if ( d[y] > d[x] + w)
                             {d[y] = d[x] + w;
                              Q.push({y, d[y]});}

        }
    }
}