Edgy Trees
You are given a tree (a connected undirected graph without cycles) of $$$n$$$ vertices. Each of the $$$n - 1$$$ edges of the tree is colored in either black or red.You are also given an integer $$$k$$$. Consider sequences of $$$k$$$ vertices. Let's call a sequence $$$[a_1, a_2, \ldots, a_k]$$$ good if it satisfies the following criterion:  We will walk a path (possibly visiting same edge/vertex multiple times) on the tree, starting from $$$a_1$$$ and ending at $$$a_k$$$.  Start at $$$a_1$$$, then go to $$$a_2$$$ using the shortest path between $$$a_1$$$ and $$$a_2$$$, then go to $$$a_3$$$ in a similar way, and so on, until you travel the shortest path between $$$a_{k-1}$$$ and $$$a_k$$$. If you walked over at least one black edge during this process, then the sequence is good.   Consider the tree on the picture. If $$$k=3$$$ then the following sequences are good: $$$[1, 4, 7]$$$, $$$[5, 5, 3]$$$ and $$$[2, 3, 7]$$$. The following sequences are not good: $$$[1, 4, 6]$$$, $$$[5, 5, 5]$$$, $$$[3, 7, 3]$$$.There are $$$n^k$$$ sequences of vertices, count how many of them are good. Since this number can be quite large, print it modulo $$$10^9+7$$$.
In the first example, all sequences ($$$4^4$$$) of length $$$4$$$ except the following are good:   $$$[1, 1, 1, 1]$$$ $$$[2, 2, 2, 2]$$$ $$$[3, 3, 3, 3]$$$ $$$[4, 4, 4, 4]$$$ In the second example, all edges are red, hence there aren't any good sequences.
The first line contains two integers $$$n$$$ and $$$k$$$ ($$$2 \le n \le 10^5$$$, $$$2 \le k \le 100$$$), the size of the tree and the length of the vertex sequence.Each of the next $$$n - 1$$$ lines contains three integers $$$u_i$$$, $$$v_i$$$ and $$$x_i$$$ ($$$1 \le u_i, v_i \le n$$$, $$$x_i \in \{0, 1\}$$$), where $$$u_i$$$ and $$$v_i$$$ denote the endpoints of the corresponding edge and $$$x_i$$$ is the color of this edge ($$$0$$$ denotes red edge and $$$1$$$ denotes black edge).
Print the number of good sequences modulo $$$10^9 + 7$$$.
from sys import stdin
from collections import Counter
(n, k) = map(int, input().split())
(N, M) = (n + 1, 10 ** 9 + 7)
parent = list(range(N))

def find(x):
    while x != parent[x]:
        parent[x] = parent[parent[x]]
        x = parent[x]
    return x
for line in stdin:
    (u, v, x) = map(int, line.split())
    if not x:
        parent[find(u)] = find(v)
ans = pow(n, k, M)
for v in Counter((find(i) for i in range(1, N))).values():
    if v > 1:
        ans -= pow(v, k, M)
    else:
        ans -= 1
print(ans % M)
from sys import stdin
from collections import Counter
(n, k) = map(int, input().split())
(N, M) = (n + 1, 10 ** 9 + 7)
parent = list(range(N))

def find(x):
    while x != parent[x]:
        parent[x] = parent[parent[x]]
        x = parent[x]
    return x
isolated = [1] * N
for line in stdin:
    (u, v, x) = map(int, line.split())
    if x == 0:
        parent[find(u)] = find(v)
        (isolated[u], isolated[v]) = (0, 0)
c = Counter((find(i) for i in range(1, N)))
ans = pow(n, k, M)
ans %= M
for v in c.values():
    if v > 1:
        ans -= pow(v, k, M)
        ans %= M
    else:
        ans -= 1
        ans %= M
print(ans)
from sys import stdin
(n, k) = map(int, stdin.readline().split())
parent = [i for i in range(n + 1)]
size = [1] * (n + 1)
MOD = 10 ** 9 + 7
ans = pow(n, k, MOD)

def find(u):
    if parent[u] == u:
        return u
    parent[u] = find(parent[u])
    return parent[u]
for i in range(n - 1):
    (u, v, c) = map(int, stdin.readline().split())
    if not c:
        pu = find(u)
        pv = find(v)
        size[pu] += size[pv]
        parent[pv] = pu
print((ans - sum([pow(size[u], k, MOD) for u in range(1, n + 1) if parent[u] == u])) % MOD)