#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007ll
#define t tie
using ll = long long;
int n;
ll ans;
#define N 250010
struct edg {
  int v;
  ll w;
  edg(int v, ll w): v(v), w(w) {}
};
vector <edg> g[N];
set<pair<int, int> >a[N];
ll f[N];
void dfs(int u, int v, ll co) {
  // a[u].emplace(n + 1, 0);
  // a[u].emplace(0, 1);
  a[u].emplace(u, 1);
  f[u] = 1 + (ll)(u - 1) * u / 2 % mod + (ll)(n - u) * (n - u + 1) / 2 % mod;
  f[u] %= mod;
  for (auto&& tmp : g[u]) {
    int i = tmp.v;
    ll w = tmp.w;
    if (i == v) continue;
    dfs(i, u, w);
    if (u == 1) continue;
    if (a[i].size() > a[u].size()) {
      swap(a[i], a[u]);
      swap(f[i], f[u]);
    }
    for (auto j = a[i].begin(); j != a[i].end(); ++j) {
      // if (!j -> se) continue;
      auto it = a[u].upper_bound(*j);
      if (it == a[u].begin()) {
        ll cz = it -> fi - 1;
        ll clz = j -> fi - 1;
        ll ctz = it -> fi - j -> fi - j -> se;
        f[u] += clz * (clz + 1) / 2 % mod + ctz * (ctz + 1) / 2 % mod - cz * (cz + 1) / 2 % mod;
        f[u] %= mod;
        if (f[u] < 0) f[u] += mod; 
        pair<int, int> ins = *j;
        if (ins.fi + ins.se == it -> fi) {
          f[u] += -(ll)(ins.se) * (ins.se + 1) / 2 % mod + (ll)(ins.se + it -> se) * (ins.se + it -> se + 1) / 2 % mod;
          f[u] %= mod;
          if (f[u] < 0) f[u] += mod;
          ins.se += it -> se;
          a[u].erase(it);
        }
        a[u].emplace(ins);
        continue;
      }
      auto pt = prev(it);
      if (it == a[u].end()) {
        ll cz = n + 1 - pt -> fi - pt -> se;
        ll clz = j -> fi - pt -> fi - pt -> se;
        ll ctz = n + 1 - j -> fi - j -> se;
        f[u] += clz * (clz + 1) / 2 % mod + ctz * (ctz + 1) / 2 % mod - cz * (cz + 1) / 2 % mod;
        f[u] %= mod;
        if (f[u] < 0) f[u] += mod;
        pair<int, int> ins = *j;
        if (pt -> fi + pt -> se == j -> fi) {
          f[u] += -(ll)(pt -> se) * (pt -> se + 1) / 2 % mod + (ll)(pt -> se + j -> se) * (pt -> se + j -> se + 1) / 2 % mod;
          f[u] %= mod;
          if (f[u] < 0) f[u] += mod;
          ins.fi = pt -> fi;
          ins.se = pt -> se + j -> se;
          a[u].erase(pt);
        }
        a[u].emplace(ins);
        continue;
      }
      ll cz = it -> fi - pt -> fi - pt -> se;
      ll clz = j -> fi - pt -> fi - pt -> se;
      ll ctz = it -> fi - j -> fi - j -> se;
      f[u] += clz * (clz + 1) / 2 % mod + ctz * (ctz + 1) / 2 % mod - cz * (cz + 1) / 2 % mod;
      f[u] %= mod;
      if (f[u] < 0) f[u] += mod;
      pair<int, int> ins = *j;
      if (pt -> fi + pt -> se == j -> fi) {
        f[u] += -(ll)(pt -> se) * (pt -> se + 1) / 2 % mod + (ll)(pt -> se + j -> se) * (pt -> se + j -> se + 1) / 2 % mod;
        f[u] %= mod;
        if (f[u] < 0) f[u] += mod;
        ins.fi = pt -> fi;
        ins.se = pt -> se + j -> se;
        a[u].erase(pt);
      }
      if (ins.fi + ins.se == it -> fi) {
        f[u] += -(ll)(ins.se) * (ins.se + 1) / 2 % mod + (ll)(ins.se + it -> se) * (ins.se + it -> se + 1) / 2 % mod;
        f[u] %= mod;
        if (f[u] < 0) f[u] += mod;
        ins.se += it -> se;
        a[u].erase(it);
      }
      a[u].emplace(ins);
    }
  }
  if (u == 1) return;
  ll zs = (ll)n * (n + 1) / 2 % mod - f[u];
  if (zs < 0) zs += mod;
  ans += zs * co % mod;
  ans %= mod;
}
int maintenance_costs_sum(vector<int> U, vector<int> V, vector<int> W) {
  n = U.size() + 1;
  for (int i = 0; i < U.size(); ++i) {
    g[U[i] + 1].emplace_back(V[i] + 1, W[i]);
    g[V[i] + 1].emplace_back(U[i] + 1, W[i]);
  }
  dfs(1, 0, 0);
  return ans;
}
#ifdef localtest
int main() {
  int tot = maintenance_costs_sum({0, 2, 2, 0}, {2, 1, 4, 3}, {2, 3, 6, 5});
  cout << tot << endl;
  return 0;
}
#endif