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

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

#define VI vector<int>
#define pb push_back

struct Pair {
    int dist, node;
    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 )
            fout << d[i] << ' ';
        else
            fout << 0 << ' ';

    fout.close();

}

void ReadGraph()
{

    int x, y, w;
    fin >> n >> m;
    G.resize(n + 1);
    while ( m-- )
    {
        fin >> x >> y >> w;
        G[x].pb({w, y});
      //  G[y].pb({w, x});
    }
    fin.close();
}
void Dijkstra(int x, vector<int>& d) // O(m * log n)
{
    d = VI(n + 1, Inf);
    d[x] = 0;
    priority_queue<Pair> Q;

    for ( Q.push({0, x}); !Q.empty(); Q.pop() )
    {
        x = Q.top().node;
        int dx = Q.top().dist;
        if ( dx > d[x] ) continue;
 for (size_t i=0;i<G[x].size();i++)
        {   Pair p=G[x][i];
            int y = p.node, w = p.dist;
            if ( d[y] > d[x] + w)
            {
                d[y] = d[x] + w;
                Q.push({d[y], y});
            }
        }
    }
}