# include <cstdio>
# include <algorithm>
# include <vector>
# include <set>

# define mp make_pair
using namespace std;

FILE *f = freopen("dijkstra.in", "r", stdin);
FILE *g = freopen("dijkstra.out", "w", stdout);

const int N_MAX = 50010;

vector <pair <int, int> > G[N_MAX];
int d[N_MAX];
set <pair <int, int> > q;

int n, m;

void read(){

    scanf("%d %d", &n, &m);

    for (int i=1; i<=m; i++){
        int x, y, z;

        scanf("%d %d %d", &x, &y, &z);

        G[x].push_back(mp(y, z));
    }

    for (int i=2; i<=n; i++)
        d[i] = 1e9;
}

void solve(){
    q.insert(mp(0, 1));
    d[1] = 0;

    while (!q.empty()){

        pair <int, int> node = *q.begin();
        q.erase(q.begin());

        for (pair <int, int> vecin : G[node.second]){
            if (d[vecin.first] > d[node.second] + vecin.second){

                if (d[vecin.first] != 1e9){
                    q.erase(mp(d[vecin.first], vecin.first));
                }

                d[vecin.first] = d[node.second] + vecin.second;
                q.insert(mp(d[vecin.first], vecin.first));
            }
        }
    }
}

void write(){
    for (int i=2; i<=n; i++)
    {
        if (d[i] != 1e9)
            printf("%d ", d[i]);
        else
            printf("0 ");
    }
}

int main(){
    read();
    solve();
    write();
    return 0;
}