#include <bits/stdc++.h>
#define nmax 2000

using namespace std;

int sp[nmax + 1], f[nmax + 1];
struct lol
{
    int nod, s;
};
vector<lol> ad[nmax + 1];
void dfs (int nod, int val)
{
    sp[nod] = val;
    for (auto i : ad[nod])
        if (f[i.nod] == 0)
            f[i.nod] = 1, dfs (i.nod, val + i.s);
}

int main()
{
    ifstream cin ("reconst.in");
    ofstream cout ("reconst.out");
    int n, m, x, y, s, i;
    cin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        cin >> x >> y >> s;
        ad[x - 1].push_back ({y, s});
        ad[y].push_back ({x - 1, -s});
    }
    for (i = 0; i <= n; i++)
        if (f[i] == 0)
            f[i] = 1, dfs (i, sp[i]);
    for (i = 1; i <= n; i++)
        if (ad[i].size() == 0)
            sp[i] = sp[i - 1];
    for (i = 1; i <= n; i++)
        cout << sp[i] - sp[i - 1] << " ";
    return 0;
}