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

using namespace std;

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

const int INF = 0x3f3f3f3f;
const int DIM = 50005;
int n, m;
int d[DIM];
bool inq[DIM];
vector < pair <int, int> > g[DIM];
queue <int> q;

void bellman()
{
    q.push(1);
    while (!q.empty())
    {
        int node = q.front();
        q.pop();
        inq[node] = 0;
        for (vector <pair <int, int> > :: iterator it = g[node].begin(); it != g[node].end(); ++it)
        {
            int v = it -> first;
            int c = it -> second;
            if (d[v] > d[node] + c)
            {
                d[v] = d[node] + c;
                if (!inq[v])
                {
                    q.push(v);
                    inq[v] = 1;
                }
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for (; m; --m)
    {
        int a, b, c;
        fin >> a >> b >> c;
        g[a].push_back(make_pair(b, c));
        g[b].push_back(make_pair(a, c));
    }
    for (int i = 2; i <= n; i++)
        d[i] = INF;
    bellman();
    for (int i = 2; i <= n; i++)
        fout << ((d[i] != INF) ? d[i] : -1) << ' ';
    return 0;
}