#include <fstream>
#include <queue>

using namespace std;

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

struct Road
{
    int len, connect;
};

struct Blah
{
    int node, leni;
    bool operator < (const Blah other) const
    {
        Blah bleah;
        return bleah.leni < other.leni;
    }
};

priority_queue <Blah> pq;

int final[50005];
vector <Road> v[50005];

void Dijkstra()
{
    while(!pq.empty())
    {
        Blah start = pq.top();
        pq.pop();
        for(int i = 0; i < v[start.node].size(); i++)
        {
            int length = v[start.node][i].len + final[start.node];
            if(length < final[v[start.node][i].connect] || (final[v[start.node][i].connect] == 0 && v[start.node][i].connect != 1))
            {
                final[v[start.node][i].connect] = length;
                pq.push({v[start.node][i].connect,length});
            }
        }
    }

}

int main(void)
{
    int n, m;
    fin >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int a;
        Road node;
        fin >> a >> node.connect >> node.len;
        v[a].push_back(node);
    }
    pq.push({1, 0});
    Dijkstra();
    for(int i = 2; i <= n; i++)
        fout << final[i] <<' ';
}