#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

struct edge{
	int to;
	ll len;
};


//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	

	int N;
	cin>>N;
	assert(2<=N&&N<=6000);
	vector<vector<edge>> G(N);
	rep(i,N-1){
		int a,b;ll c;
		cin>>a>>b>>c;
		a--,b--;
		G[a].push_back({b,c});
		G[b].push_back({a,c});
	}
	ll ans=0;
	rep(i,N){
		vector<ll> seen(N,-1);
		vector<int> order={(int)i};
		seen[i]=(1<<30)-1;
		rep(j,N){
			int var=order[j];
			for(auto e:G[var]){
				if(seen[e.to]==-1){
					seen[e.to]=(e.len&seen[var]);
					order.push_back(e.to);
					if(i<e.to){
						ans+=seen[e.to];
						ans%=mod;
					}
				}
			}
		}
	}
	cout<<ans<<endl;
}