#include <stdio.h>
#include <vector>
#define MOD 1000000007

std::vector< std::pair<int,int> > edge[110];
int next[100010],size[100010];
int find(int k)
{
	if(k==next[k]) return k;
	else return next[k] = find(next[k]);
}

int main()
{
	int a;
	scanf("%d",&a);
	for(int i=1;i<a;i++)
	{
		int b,c,d;
		scanf("%d%d%d",&b,&c,&d);
		for(int j=1;j<=30;j++)
		{
			if(d%2==1) edge[j].push_back(std::make_pair(b,c));
			d/=2;
		}
	}
	
	long long int ans = 0;
	for(int j=1;j<=30;j++)
	{
		for(int i=1;i<=a;i++) next[i] = i;
		for(int i=1;i<=a;i++) size[i] = 1;
		
		for(int i=0;i<edge[j].size();i++)
		{
			int s = edge[j][i].first;
			int t = edge[j][i].second;
			if(find(s)!=find(t))
			{
				size[find(t)] += size[find(s)];
				next[find(s)] = find(t);
			}
		}
		
		for(int i=1;i<=a;i++)
		{
			if(i==find(i))
			{
				long long int val = (long long int)size[i]*(size[i]-1)/2;
				val %= MOD, val *= (1<<(j-1)), val %= MOD;
				ans += val, ans %= MOD;
			}
		}
	}
	printf("%lld",ans);
}