#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<string>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<stack>
#include<fstream>
#include<map>
#include<bitset>
#include<unordered_map>
#include<cstring>
#include<cctype>
using namespace std;
#define  ll long long
#define  ull unsigned long long
#define  ul unsigned long
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sz(n) (int)n.size()
#define pb(s) push_back(s);
#define format(n) fixed<<setprecision(n)
#define finl "\n"
#define Mohammed_Atef_Hassan fast();
#define md 1000000007
#define INF LLONG_MAX
#define PI acos(-1)
#define clr(dp,n) memset(dp,n,sizeof dp)
#define ex(n) return cout<<n<<finl,0;
int dx[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
int dy[] = { 1, 0, -1, 0, 1, -1, 1, -1 };
ll fix_mod(ll x, ll y)
{
    return (y + x % y) % y;
}
void fast()
{
    std::ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

#ifdef ONLINE_JUDGE
    //freopen("crosses.in", "r", stdin);

    //freopen("crosses.out", "w", stdout);
#endif
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
#endif
}
vector<vector<pair<int,ll>>>edg1,edg2;
vector<vector<ll>>xor1,xor2;
void dfs1(int u,int p,ll w)
{
    for(int i=0; i<30; i++)
    {
        xor1[u][i]=(xor1[p][i]^(w%2));
        w/=2;
    }
    for(auto v:edg1[u])
    {
        if(v.first==p)continue;
        dfs1(v.first,u,v.second);
    }
}
void dfs2(int u,int p,ll w)
{
    for(int i=0; i<30; i++)
    {
        xor2[u][i]=(xor2[p][i]^(w%2));
        w/=2;
    }
    for(auto v:edg2[u])
    {
        if(v.first==p)continue;
        dfs2(v.first,u,v.second);
    }
}
int main()
{
    Mohammed_Atef_Hassan
    int n;
    cin>>n;
    edg1=vector<vector<pair<int,ll>>>(n+1);
    edg2=vector<vector<pair<int,ll>>>(n+1);
    xor1=vector<vector<ll>>(n+1,vector<ll>(30,0));
    xor2=vector<vector<ll>>(n+1,vector<ll>(30,0));
    for(int i=1; i<n; i++)
    {
        int u,v,w;
        cin>>u>>v>>w;
        edg1[u].push_back({v,w});
        edg1[v].push_back({u,w});
    }
    for(int i=1; i<n; i++)
    {
        int u,v,w;
        cin>>u>>v>>w;
        edg2[u].push_back({v,w});
        edg2[v].push_back({u,w});
    }
    dfs1(1,1,0);dfs2(1,1,0);
    vector<ll>dig1(30,0),dig2(30,0);
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<30;j++)
        {
            dig1[j]+=xor1[i][j];
            dig2[j]+=xor2[i][j];
        }
    }
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        for(ll j=0;j<30;j++)
        {
            ll zero1=(xor1[i][j]?dig1[j]:n-dig1[j]);ll one2=(xor2[i][j]?n-dig2[j]:dig2[j]);
            ll cur1=zero1*one2; cur1%=md; cur1*=(1LL<<j); cur1%=md;
            ans+=cur1; ans%=md;
            ll one1=(xor1[i][j]?n-dig1[j]:dig1[j]);ll zero2=(xor2[i][j]?dig2[j]:n-dig2[j]);
             ll cur2=zero2*one1; cur2%=md; cur2*=(1LL<<j); cur2%=md;
            ans+=cur2; ans%=md;
        }
    }
    cout<<ans<<finl;
}