//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll  long long
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define REP(i,n) for(int i=0;i<n;i++)
const int N = 3e5+10;
const ll mod = 1e9+7;
 

void run_case(){
	int a[3];
	int i;
	for(i=0;i<3;i++)
		cin >> a[i];
	sort(a,a+3);
	if(a[0]+a[2]==2*a[1])
		cout<<"Yes";
	else
	cout<<"No";	
}

int main(){
	fast;
	int t;
	t=1;
	while(t--){
		run_case();
	}
}

//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define pi pair<int,string>
#define REP(i,n) for(int i=0;i<n;i++)
const int N = 2e5+10;
ll mod = 1e9+7;


void run_case(){
	vector<pi> v;
	string s;
	int t;
	int i,n;
	cin >> n;
	for(i=0;i<n;i++){
		cin >> s >> t;
		v.pb({t,s});
	}	
	sort(all(v));
	cout<<v[n-2].S<<"\n";

}

int main(){
	fast;
	int q;
	q=1;
	while(q--){ 
		run_case();
	}
}
 

//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll  long long
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define REP(i,n) for(int i=0;i<n;i++)
const int N = 2e5+2;
const ll mod = 1e9+7;

set<int> have,pos,no;
int cnt=0;
vector<int> now;

void rec(vector<int> a){
	if(a.size()==4){
		set<int> haves;
		bool ok=true;
		for(int j=0;j<4;j++){
			if(have.count(a[j]))
				haves.insert(a[j]);
			if(no.count(a[j]))
				ok=false;
		}
		if((int)haves.size()==(int)have.size() and ok)
			++cnt;
		return;
	}
	for(int i=0;i<=9;i++){
		a.pb(i);
		rec(a);
		a.pop_back();
	}
}

void run_case(){
	string s;
	cin >> s;
	int i,n=s.length();

	for(i=0;i<n;i++){
		if(s[i]=='o')
			have.insert(i);
		if(s[i]=='?')
			pos.insert(i);
		if(s[i]=='x')
			no.insert(i);
	}
	rec(now);
	cout<<cnt<<"\n";
}
 
int main(){
	fast;
	int tt;
	tt=1;
	while(tt--){
		run_case();
	}
	
	
}

//Think simple yet elegant.
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll  long long
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define pi pair<int,int>
#define REP(i,n) for(int i=0;i<n;i++)
const int N = 2e5+10;
const ll mod = 1e9+7;
const int BLOCK_SIZE = 200;



vector<vector<pair<int,ll>>> g(N);
vector<ll> d(N,0);


void df(int v,int p){
	for(auto [to,wei] : g[v]){
		if(to!=p){
			d[to]=d[v]^wei;
			df(to,v);
		}
	}
}
ll add(ll a,ll b){
	return (a%mod + b%mod)%mod;
}
ll mul(ll a,ll b){
	return ((a%mod)*(b%mod))%mod;
}
ll bin(ll a, ll b) {
	a%=mod;
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % mod; //mod
        a = a * a % mod; //mod
        b >>= 1;
    }
    return res;
}

void run_case(){
	ll i,j,n,u,v,w;
	cin >> n;	
	for(i=0;i<n-1;i++){
		cin >> u >> v >> w;
		--u,--v;
		g[u].pb({v,w});
		g[v].pb({u,w});
	}
	df(0,-1);
	vector<ll> cnt(60,0);
	for(i=0;i<n;i++){
		for(j=0;j<60;j++){
			if(d[i]&(1LL<<j))
				++cnt[j];
		}
	}

	ll ans=0;
	for(i=0;i<n;i++){
		for(j=0;j<60;j++){
			if(d[i]&(1LL<<j)){
				ans = add(ans,mul(1LL<<j,1LL*n-cnt[j]));
			}
			else
				ans = add(ans,mul(1LL<<j,cnt[j]));
		}
	}
	ll inv2 = bin(2,mod-2);
	ans = mul(ans,inv2);

	cout<<ans<<"\n";

}
int main(){
	fast;
	int t=1;
	while(t--){
		run_case();
	}
}