#include<bits/stdc++.h>
using namespace std;

// Shortcut

#define int long long
#define endl '\n'
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)

// I/O & Debug

#define PrintV(a) for (int iiii = 0; iiii < a.size(); iiii++) cout << a[iiii] << ' ';
#define PrintVl(a) for (int iiii = 0; iiii < a.size(); iiii++) cout << a[iiii] << endl;
#define PrintA(a, n) for (int iiii = 0; iiii < n; iiii++) cout << a[iiii] << ' ';
#define PrintAl(a, n) for (int iiii = 0; iiii < n; iiii++) cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(), _sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string> _itDEB(_ssDEB); DEB(_itDEB, args); }
void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
    cout << *it << " = " << a << endl;
    DEB(++it, args...);
}
*/

// Functions

//#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a));
//mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());

// Data Structure

#define pque priority_queue
#define mts multiset
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <ld> vld;
typedef vector <string> vs;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <vi > vvi;
typedef vector <vll > vvll;
typedef vector <pii > vpii;
typedef vector <pll > vpll;

const int N = 1e5 + 5, mod = 1e9 + 7, inf = 1e18 + 5;

struct edge{
    int x, y, val;
    bool operator < (const edge &aa) const{
        return val > aa.val;
    }
};

int n;
vector <edge> a;
vi g[N];
int sum[N], par[N], ans[N];

void merge(int x, int y, int val){
    x = par[x];
    y = par[y];
    if (g[x].size() < g[y].size()){
        swap(x, y);
    }
    sum[x] += val * g[y].size();
    sum[y] += val * g[x].size();
    Fora(i, g[y]){
        g[x].pb(i);
        par[i] = x;
        ans[i] -= sum[x];
        ans[i] += sum[y];
    }
    g[y].clear();
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    For(i, 0, n - 1){
        int x, y, val;
        cin >> x >> y >> val;
        a.pb({x - 1, y - 1, val});
    }
    sort(bend(a));
    For(i, 0, n){
        par[i] = i;
        g[i].pb(i);
    }
    For(i, 0, n - 1){
        merge(a[i].x, a[i].y, a[i].val);
    }
    For(i, 0, n){
        cout << ans[i] + sum[par[i]] << endl;
    }
}

/*
==================================+
INPUT:                            |
------------------------------    |
15
6 3 2
13 3 1
1 13 2
7 1 2
8 1 1
2 8 2
2 12 2
5 2 2
2 11 2
10 2 2
10 9 1
9 14 2
4 14 1
11 15 2
------------------------------    |
==================================+
OUTPUT:                           |
------------------------------    |
16
20
15
14
20
15
16
20
15
20
20
20
16
15
20
------------------------------    |
==================================+
*/

Measured memory_bytes: 19696