#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");
vector <pair <int, int>> v[50001];
bool okq[50001];
int opt[50001], d[50001];
queue <int> q;
bool bellman(int n)
{
int i, na;
for (i = 1; i<=n; i++)
d[i] = 1<<30;
d[1] = 0;
okq[1] = 1;
q.push(1);
while (q.empty() == 0)
{
na = q.front();
q.pop();
okq[na] = 0;
for (i = 0; i < v[na].size(); i++)
if (d[v[na][i].first] > d[na] + v[na][i].second)
{
d[v[na][i].first] = d[na] + v[na][i].second;
if (okq[v[na][i].first] == 0)
{
okq[v[na][i].first] = 1;
q.push(v[na][i].first);
opt[v[na][i].first]++;
if (opt[v[na][i].first] == n)
return 0;
}
}
}
return 1;
}
int main()
{
int n, m, i, x, y, z;
fin >> n >> m;
for (i = 1; i<=m; i++)
{
fin >> x >> y >> z;
v[x].push_back({y, z});
}
if (bellman(n) == 0)
fout << "Ciclu negativ!";
else
for (i = 2; i<=n; i++)
fout << d[i] << ' ';
return 0;
}