class UnionFindVerSize():
    def __init__(self, N):
        self._parent = [n for n in range(0, N)]
        self._size = [1] * N

    def find_root(self, x):
        if self._parent[x] == x: return x
        self._parent[x] = self.find_root(self._parent[x])
        return self._parent[x]

    def unite(self, x, y):
        gx = self.find_root(x)
        gy = self.find_root(y)
        if gx == gy: return

        if self._size[gx] < self._size[gy]:
            self._parent[gx] = gy
            self._size[gy] += self._size[gx]
        else:
            self._parent[gy] = gx
            self._size[gx] += self._size[gy]

    def get_size(self, x):
        return self._size[self.find_root(x)]

    def is_same_group(self, x, y):
        return self.find_root(x) == self.find_root(y)

    def calc_group_num(self):
        N = len(self._parent)
        ans = 0
        for i in range(N):
            if self.find_root(i) == i:
                ans += 1
        return ans

import sys
from collections import deque

input=sys.stdin.readline
sys.setrecursionlimit(2*10**5)

N,M,X=map(int,input().split())
uf=UnionFindVerSize(N)
ans=0
mod=10**9+7

MST = []
edge = [[] for i in range(N)]
for i in range(M):
    x,y,z=map(int,input().split())
    x-=1
    y-=1
    if not uf.is_same_group(x,y):
        uf.unite(x,y)
        edge[x].append((y,z))
        edge[y].append((x,z))

size=[1 for i in range(N)]
def dfs(v,pv):
    for nv,c in edge[v]:
        if nv!=pv:
            dfs(nv,v)
            size[v]+=size[nv]

dfs(0,-1)
res=0
for u in range(N):
    for v,c in edge[u]:
        if size[u]<size[v]:
            res+=pow(X,c,mod)*size[u]*(N-size[u])
            res%=mod

print(res)