#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f ("reconst.in");
ofstream g ("reconst.out");

const int NMAX = 2000 + 1;

int n, m;
bool vizitat[NMAX];
int sol[NMAX];
vector < pair <int, int> > graf[NMAX];

void citeste() {
    int a, b, s;
    f >> n >> m;
    for (int i = 1; i <= n; i++) {
        f >> a >> b >> s;
        a--;
        graf[a].push_back(make_pair(b, s));
        graf[b].push_back(make_pair(a, -s));
    }
}

void DFS(int nod) {
    vizitat[nod] = true;
    int l = graf[nod].size(), fiu;
    for (int i = 0; i < l; i++) {
        fiu = graf[nod][i].first;
        if (!vizitat[fiu]) {
            sol[fiu] = sol[nod] + graf[nod][i].second;
            DFS(fiu);
        }
    }
}

int main() {
    citeste();
    for (int i = 0; i <= n; i++)
        if (!vizitat[i]) DFS(i);
    for (int i = 1; i <= n; i++) g << sol[i] - sol[i - 1] << ' ';
    return 0;
}