import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

class Main {
	
	public static void main(String[] args) {
		new Main().run();
	}
	
	
	void run() {
		solve();
	}
	
	class DSU {
		int[] parent;

		public DSU(int n) {
			parent=new int[n];
			Arrays.fill(parent, -1);
		}
		
		int root(int x) {
			return parent[x] < 0 ? x : (parent[x]=root(parent[x]));
		}
		
		boolean equiv(int x, int y) {
			return root(x) == root(y);
		}
		
		int sz(int x) {
			return -parent[root(x)];
		}
		
		void union(int x, int y) {
			x=root(x);y=root(y);
			if (x==y) return;
			if (sz(x)<sz(y)) {
				x^=y;y^=x;x^=y;
			}
			parent[y]+=parent[x];
			parent[x]=y;
		}
		
		boolean isroot(int x) {
			return parent[x]<0;
		}
	}
	
	
	void solve() {
		FastScanner sc=new FastScanner();
		PrintWriter pw=new PrintWriter(System.out);
		int N=sc.nextInt();
		int[] A=new int[N-1];
		int[] B=new int[N-1];
		int[] C=new int[N-1];
		for (int i=0;i<N-1;++i) {
			A[i]=sc.nextInt()-1;
			B[i]=sc.nextInt()-1;
			C[i]=sc.nextInt();
		}
		long ans=0;
		long mod=(long) 1e9+7; 
		for (int b=0;b<30;++b) {
			DSU dsu=new DSU(N);
			for (int i=0;i<N-1;++i) {
				if ((C[i]>>b)%2==0) continue;
				dsu.union(A[i], B[i]);
			}
			for (int i=0;i<N;++i) if (dsu.isroot(i)) {
				ans+=(1L<<b)*(1L*dsu.sz(i)*(dsu.sz(i)-1)/2 % mod) %mod;
				ans%=mod;
			}
		}
		System.out.println(ans);
		
		pw.close();
	}
	
	static void tr(Object...objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}


class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
    	return (int)nextLong();
    }
}