import java.io.*;
import java.util.*;

public class Main {
    static final int MOD = 1000000007;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int[] lefts = new int[n - 1];
        int[] rights = new int[n - 1];
        int[] costs = new int[n - 1];
        for (int i = 0; i < n - 1; i ++) {
            lefts[i] = sc.nextInt() - 1;
            rights[i] = sc.nextInt() - 1;
            costs[i] = sc.nextInt();
        }
        UnionFindTree uft = new UnionFindTree(n);
        long ans = 0;
        for (int i = 0; i < 30; i++) {
            uft.clear();
            int base = (1 << i);
            for (int j = 0; j < n - 1; j++) {
                if ((costs[j] & base) != 0) {
                    uft.unite(lefts[j], rights[j]);
                }
            }
            boolean[] used = new boolean[n];
            for (int j = 0; j < n; j++) {
                int x = uft.find(j);
                if (used[x]) {
                    continue;
                }
                used[x] = true;
                ans += (long)(uft.counts[x]) * (uft.counts[x] - 1) / 2 % MOD * base % MOD;
                ans %= MOD;
            }
        }
        System.out.println(ans);
    }
    
    static class UnionFindTree {
        int[] parents;
        int[] counts;
        
        public UnionFindTree(int size) {
            parents = new int[size];
            counts = new int[size];
        }
        
        public void clear() {
            for (int i = 0; i < parents.length; i++) {
                parents[i] = i;
                counts[i] = 1;
            }
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public void unite(int x, int y) {
            int xx = find(x);
            int yy = find(y);
            if (xx == yy) {
                return;
            }
            parents[xx] = yy;
            counts[yy] += counts[xx];
        }
    }
}

class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}