#include<bits/stdc++.h>
#define int long long

using namespace std;

#define MOD 1000000007

void solve()
{
    int n;
    cin>>n;
    int a,b,c;
    int num = n+1;
    int ans = 0;
    vector<vector<pair<int,int>>>gra(num);
    for(int i=0;i<n-1;i++)
    {
        cin>>a>>b>>c;
        gra[a].push_back({b,c});
        gra[b].push_back({a,c});
    }
    queue<int>q;
    q.push(1);
    vector<int>visited(n+1),distance(n+1);
    distance[1] = 0;
    while(!q.empty())
    {
        int r = q.front();
        q.pop();
        if(visited[r]==1)
        {
            continue;
        }
        visited[r] = 1;
        for(int i=0;i<gra[r].size();i++)
        {
            distance[gra[r][i].first] = distance[r]^gra[r][i].second;
            // cout<<gra[r][i].first<<" "<<distance[gra[r][i].first]<<endl;
            q.push(gra[r][i].first);
        }
    }
    for(int i=1;i<=61;i++)
    {
        int numo = 0,numz = 0;
        for(int j=1;j<=n;j++)
        {   
            if(distance[j]&1)
                numo++;
            else 
                numz++;
            distance[j] = distance[j]>>1;
        }
        int pans = (((int)pow(2,i-1)%MOD*numo)%MOD*numz)%MOD;
        // cout<<pans<<endl;
        ans=(ans+pans)%MOD;
    }
    cout<<ans<<endl;
}

signed  main()
{
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan0
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/














int N;
vector<pair<int, ll>> E[201010];
ll xo[201010];
//---------------------------------------------------------------------------------------------------
void dfs(int cu, int pa, ll x) {
    xo[cu] = x;
    fore(p, E[cu]) if (pa != p.first) dfs(p.first, cu, x ^ p.second);
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N;
	rep(i, 0, N - 1) {
        int a, b; ll c; cin >> a >> b >> c;
		a--; b--;
		E[a].push_back({ b, c });
		E[b].push_back({ a, c });
	}

    dfs(0, -1, 0);

    mint ans = 0;
    rep(bit, 0, 60) {
        ll msk = 1LL << bit;
        ll cnt[2] = { 0, 0 };
        rep(i, 0, N) cnt[(xo[i] & msk) != 0]++;
        ans += mint(msk) * mint(cnt[0]) * mint(cnt[1]);
    }
    cout << ans << endl;
}





