#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

class cmp
{
public:
    bool operator() (const pair<int, int> &a, const pair<int,int> &b) {
        return a.second > b.second;
    }
};

priority_queue <pair<int,int>, vector<pair<int,int>>,cmp> H;

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int n, m;
    scanf("%d%d", &n, &m);
    vector <pair<int,int>> *gr = new vector<pair<int, int>>[n + 1];
    vector <int> d(n+1, 1<<30);
    for(int i = 1; i <= m; ++i) {
        int x, y, cost;
        scanf("%d%d%d", &x, &y, &cost);
        gr[x].push_back({y, cost});
    }
    H.push({1, 0});
    d[1] = 0;
    while(!H.empty()) {
        pair <int,int> u = H.top();
        H.pop();
        if(d[u.first] != u.second)
            continue;
        for(auto x: gr[u.first])
        {
            if(d[x.first] > d[u.first] + x.second)
            {
                d[x.first] = d[u.first] + x.second;
                H.push({x.first, d[x.first]});
            }
        }
    }
    for(int i = 2; i <= n; ++i)
        if(d[i] == (1 << 30))
            printf("0 ");
        else
            printf("%d ",d[i]);
    printf("\n");
    return 0;
}