#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define maxN 2002
using namespace std;
int n, m, i, j, sum[maxN];
bool vis[maxN];
vector < pair < int, int > > V[maxN];
void read()
{
    int a, b, s;
    freopen("reconst.in", "r", stdin);
    scanf("%d %d", &n, &m);
    for (i = 1; i <= m; ++ i)
    {
        scanf("%d %d %d", &a, &b, &s);
        -- a;
        V[a].push_back(make_pair(b, s));
        V[b].push_back(make_pair(a, -s));
    }
}
void dfs(int x)
{
    int i, node;
    vis[x] = 1;
    for (i = 0; i < V[x].size(); ++ i)
        if (!vis[node = V[x][i].first])
    {
        sum[node] = sum[x] + V[x][i].second;
        dfs(node);
    }
}
void solve()
{
    for (i = 1; i <= n; ++ i)
        if (!vis[i])
           dfs(i);
}
void write()
{
    freopen("reconst.out", "w", stdout);
    for (i = 1; i <= n; ++ i)
        printf("%d ", sum[i] - sum[i - 1]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}