#include<fstream>
#include<string.h>
#include<queue>

using namespace std;

typedef pair <int, int> Pair;

const int maxn = 50005;
const int inf = 0x3f3f3f3f;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

vector <Pair> v[maxn];
queue <int> q;
int d[maxn];
int n,m;

void dijkstra()
{
    q.push(1);
    d[1] = 0;
    while(!q.empty())
    {
        int nod  = q.front();
        q.pop();

        for(int i=0; i < v[nod].size(); ++i)
        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);
        }
    }

}

int main()
{
    int a,b,c;
    cin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        cin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    memset(d, inf, sizeof d);

    dijkstra();

    for(int i=2;i<=n;++i)
        cout<<(d[i] != inf ? d[i] : 0)<<' ';
}