/* -*- coding: utf-8 -*-
 *
 * 1843.cc:  No.1843 Tree ANDistance - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int BN = 30;
const int MOD = 1000000007;

/* typedef */

typedef long long ll;

struct UFT {
  int links[MAX_N], ranks[MAX_N], sizes[MAX_N];
  UFT() {}

  void init(int n) {
    for (int i = 0; i < n; i++) links[i] = i, ranks[i] = sizes[i] = 1;
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

int as[MAX_N], bs[MAX_N], cs[MAX_N], ss[MAX_N];
UFT uft;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d%d", as + i, bs + i, cs + i);
    as[i]--, bs[i]--;
  }

  int sum = 0;
  for (int i = 0, bi = 1; i < BN; i++, bi <<= 1) {
    uft.init(n);

    for (int j = 0; j < n - 1; j++)
      if (cs[j] & bi) uft.merge(as[j], bs[j]);

    fill(ss, ss + n, 0);
    for (int j = 0; j < n; j++) ss[uft.root(j)]++;

    for (int j = 0; j < n; j++) {
      int s = ((ll)ss[j] * (ss[j] - 1) / 2) % MOD;
      sum = (sum + (ll)s * bi % MOD) % MOD;
    }
  }

  printf("%d\n", sum);
  return 0;
}