#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f
using namespace std;
ifstream is ("dijkstra.in");
ofstream os ("dijkstra.out");

vector <pair<int, int> > V[25001];
vector <int> d;
queue <int> Q;
bool viz[25001];
int n, m;
void Read();
void BFS();

int main()
{
    Read();
    BFS();
    for(int i = 2; i <= n; ++i)
        os << d[i] << ' ';
    return 0;
}
void Read()
{
    int x, y, z;
    is >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        is >> x >> y >> z;
        V[x].push_back(make_pair(y, z));
        V[y].push_back(make_pair(x, z));
    }
    d.resize(n+1, INF);
    d[1] = 0;
    Q.push(1);
}
void BFS()
{
    int nod;
    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        for(unsigned i = 0; i < V[nod].size(); ++i)
        {
            if(!viz[V[nod][i].first])
            {
                if(d[V[nod][i].first] > d[nod] + V[nod][i].second)
                    d[V[nod][i].first] = d[nod] + V[nod][i].second;
                Q.push(V[nod][i].first);
            }

        }
        viz[nod] = true;

    }
}