#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define PA pair<int, int>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, x, y, z, d[50005];
vector<PA> G[50005];
priority_queue<PA, vector<PA>, greater<PA> > Q;

void dijkstra(int s) {
    for(int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    Q.push({0, s});
    d[s] = 0;
    while(!Q.empty()) {
        x = Q.top().first;
        y = Q.top().second;
        Q.pop();
        if(x > d[y]) {
            continue;
        }
        for(unsigned int i = 0; i < G[y].size(); i++) {
            int vecin = G[y][i].first;
            int cost = G[y][i].second;
            if(d[y] + cost < d[vecin]) {
                d[vecin] = d[y] + cost;
                Q.push({d[vecin], vecin});
            }
        }
    }
}

int main() {
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
    	fin >> x >> y >> z;
        G[x].push_back({y, z});
    }
    fin.close();
    dijkstra(1);
    for(int i = 2; i <= n; i++) {
        fout << (d[i] == INF ? -1 : d[i]);
    }
    fout.close();
	return 0;
}