Problem:
Score : 800 points

Problem Statement

Snuke Festival 2017 will be held in a tree with N vertices numbered 1,2, ...,N.
The i-th edge connects Vertex a_i and b_i, and has joyfulness c_i.

The staff is Snuke and N-1 black cats.
Snuke will set up the headquarters in some vertex, and from there he will deploy a cat to each of the other N-1 vertices.

For each vertex, calculate the niceness when the headquarters are set up in that vertex.
The niceness when the headquarters are set up in Vertex i is calculated as follows:

Let X=0.

For each integer j between 1 and N (inclusive) except i, do the following:

Add c to X, where c is the smallest joyfulness of an edge on the path from Vertex i to Vertex j.

The niceness is the final value of X.

Constraints

1 \leq N \leq 10^{5}

1 \leq a_i,b_i \leq N

1 \leq c_i \leq 10^{9}

The given graph is a tree.

All input values are integers.

Partial Scores

In the test set worth 200 points, N \leq 1000.

In the test set worth 200 points, c_i \leq 2.

Input

Input is given from Standard Input in the following format:

N
a_1 b_1 c_1
:
a_{N-1} b_{N-1} c_{N-1}

Output

Print N lines. The i-th line must contain the niceness when the headquarters are set up in Vertex i.

Sample Input 1

3
1 2 10
2 3 20

Sample Output 1

20
30
30

The figure below shows the case when headquarters are set up in each of the vertices 1, 2 and 3.

The number on top of an edge denotes the joyfulness of the edge, and the number below an vertex denotes the smallest joyfulness of an edge on the path from the headquarters to that vertex.

Sample Input 2

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

Sample Output 2

16
20
15
14
20
15
16
20
15
20
20
20
16
15
20

Sample Input 3

19
19 14 48
11 19 23
17 14 30
7 11 15
2 19 15
2 18 21
19 10 43
12 11 25
3 11 4
5 19 50
4 11 19
9 12 29
14 13 3
14 6 12
14 15 14
5 1 6
8 18 13
7 16 14

Sample Output 3

103
237
71
263
370
193
231
207
299
358
295
299
54
368
220
220
319
237
370

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>

typedef int32_t i32;
typedef int64_t i64;
typedef uint64_t u64;

typedef struct union_find_add {
  i32 *parent;
  i64 *add;
} union_find;

union_find* new_union_find (i32 n) {
  union_find *u = (union_find *) calloc (1, sizeof (union_find));
  u->parent = (i32 *) calloc (n, sizeof (i32));
  u->add = (i64 *) calloc (n, sizeof (i64));
  for (i32 i = 0; i < n; ++i) {
    u->parent[i] = -1;
  }
  return u;
}

i32 root (union_find *u, i32 x) {
  i32 stack[32];
  i32 top = 0;
  stack[top++] = x;
  while (u->parent[x] >= 0) {
    x = u->parent[x];
    stack[top++] = x;
  }
  i32 r = stack[top - 1];
  i64 buf = 0;
  for (i32 i = top - 2; i >= 0; --i) {
    i32 y = stack[i];
    i64 next = buf + u->add[y];
    u->add[y] += buf;
    buf = next;
    u->parent[y] = r;
  }
  return r;
}

void unite (union_find *u, i32 x, i32 y) {
  x = root (u, x);
  y = root (u, y);
  if (x == y) return;
  if (u->parent[x] > u->parent[y]) {
    i32 s = x;
    x = y;
    y = s;
  }
  u->add[y] -= u->add[x];
  u->parent[x] += u->parent[y];
  u->parent[y] = x;
}

void add (union_find *u, i32 x, i64 v) {
  u->add[root (u, x)] += v;
}

i64 find (union_find *u, i32 x) {
  i32 r = root (u, x);
  return r == x ? u->add[x] : u->add[x] + u->add[r];
}

void radix_sort (u64 *a, i32 n) {
  const i32 w = 5;
  const i32 mask = (1 << w) - 1;
  u64 *val = (u64 *) calloc (n, sizeof (u64));
  i32 *next = (i32 *) calloc (n + (1 << w), sizeof (i32));
  i32 *start = next + n;
  for (i32 b = 34; b < 64; b += w) {
    for (i32 j = 0; j < (1 << w); ++j) {
      start[j] = -1;
    }
    for (i32 i = 0; i < n; ++i) {
      i32 k = (a[i] >> b) & mask;
      val[i] = a[i];
      next[i] = start[k];
      start[k] = i;
    }
    for (i32 i = n - 1, k = mask; k >= 0; --k) {
      for (i32 p = start[k]; p != -1; p = next[p]) {
        a[i--] = val[p];
      }
    }
  }
  free (val);
  free (next);
}

static void print_int(i64 n){if(n<0){putchar('-');n=-n;}if(n==0){putchar('0');return;}int s[20],len=0;while(n>0){s[len++]=n%10+'0';n/=10;}while(len>0){putchar(s[--len]);}}
static i64 read_int(void){int prev='\0';int c=getchar();while(!('0'<=c && c<='9')){prev=c;c=getchar();}i64 res=0;while('0'<=c && c<='9'){res=10*res+c-'0';c=getchar();}return prev=='-'?-res:res;}

void run (void) {
  i32 n;
  scanf ("%" SCNi32, &n);
  u64 *e = (u64 *) calloc (n - 1, sizeof (u64));
  const i32 f = 17;
  const i32 mask = (1 << f) - 1;
  for (i32 i = 0; i < n - 1; ++i) {
    i32 a = read_int() - 1;
    i32 b = read_int() - 1;
    i32 c = read_int();
    e[i] = ((u64) c << 2 * f) + ((u64) a << f) + b;
  }
  radix_sort (e, n - 1);
  union_find *u = new_union_find (n);
  for (i32 i = n - 2; i >= 0; --i) {
    i32 a = root (u, e[i] & mask);
    i32 b = root (u, e[i] >> f & mask);
    i64 c = e[i] >> 2 * f;
    add (u, b, -u->parent[a] * c);
    add (u, a, -u->parent[b] * c);
    unite (u, a, b);
  }
  for (i32 i = 0; i < n; ++i) {
    print_int (find (u, i));
    putchar ('\n');
  }
}

int main (void) {
  run();
  return 0;
}