#include<bits/stdc++.h>
using namespace std;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
}f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m;
struct gul{int dest, dist;};
vector<gul>v[50002];
bool viz[50002];
long long dmin[50002];
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int a,b,d;
        f>>a>>b>>d;
        v[a].push_back({b,d});
        v[b].push_back({a,d});
    }
    for(int i=2;i<=n;++i)
        dmin[i]=1e9;
    deque<int>d;
    d.push_back(1);
    while(!d.empty())
    {
        int nod=d[0];
        for(int j=0;j<v[nod].size();++j)
            if(dmin[nod]+v[nod][j].dist<dmin[v[nod][j].dest])
                dmin[v[nod][j].dest]=dmin[nod]+v[nod][j].dist,d.push_back(v[nod][j].dest);
        d.pop_front();
    }
    for(int i=2;i<=n;++i)
        if(dmin[i]==1e9)
            g<<"0 ";
        else
            g<<dmin[i]<<" ";
    return 0;
}