#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int VAL=50005;
const int INF=2000000000;

int N, M, i, j, cost[VAL], A, B, C, nod;
vector < pair <int, int> > G[VAL];
vector < pair <int, int> > :: iterator it;
queue <int> Q;

void BFS()
{
    Q.push(1);
    while (Q.empty()==false)
    {
        nod=Q.front();
        Q.pop();
        for (it=G[nod].begin(); it!=G[nod].end(); it++)
        {
            if (cost[it->first]>cost[nod]+it->second)
            {
                cost[it->first]=cost[nod]+it->second;
                Q.push(it->first);
            }
        }
    }
}

int main()
{
    fin >> N >> M;
    for (i=2; i<=N; i++)
        cost[i]=INF;
    for (i=1; i<=M; i++)
    {
        fin >> A >> B >> C;
        G[A].push_back({B, C});
    }
    BFS();
    for (i=2; i<=N; i++)
        fout << cost[i] << " ";
    fin.close();
    fout.close();
    return 0;
}