0-1-Tree
You are given a tree (an undirected connected acyclic graph) consisting of $$$n$$$ vertices and $$$n - 1$$$ edges. A number is written on each edge, each number is either $$$0$$$ (let's call such edges $$$0$$$-edges) or $$$1$$$ (those are $$$1$$$-edges).Let's call an ordered pair of vertices $$$(x, y)$$$ ($$$x \ne y$$$) valid if, while traversing the simple path from $$$x$$$ to $$$y$$$, we never go through a $$$0$$$-edge after going through a $$$1$$$-edge. Your task is to calculate the number of valid pairs in the tree.
The picture corresponding to the first example:
The first line contains one integer $$$n$$$ ($$$2 \le n \le 200000$$$) — the number of vertices in the tree.Then $$$n - 1$$$ lines follow, each denoting an edge of the tree. Each edge is represented by three integers $$$x_i$$$, $$$y_i$$$ and $$$c_i$$$ ($$$1 \le x_i, y_i \le n$$$, $$$0 \le c_i \le 1$$$, $$$x_i \ne y_i$$$) — the vertices connected by this edge and the number written on it, respectively.It is guaranteed that the given edges form a tree.
Print one integer — the number of valid pairs of vertices.
from collections import deque
from sys import stdin

def bfs(source, graph, mark, fcount):
    visited = [source]
    q = deque()
    mark[source] = True
    q.append(source)
    while q:
        u = q.popleft()
        for v in graph[u]:
            if not mark[v]:
                mark[v] = True
                visited.append(v)
                q.append(v)
    for u in visited:
        fcount[u] = len(visited)

def main():
    n = int(stdin.readline())
    g = [[[] for _ in range(0, n)] for _ in range(0, 2)]
    cnt = [[0 for _ in range(0, n)] for _ in range(0, 2)]
    for line in stdin.readlines():
        (u, v, c) = map(int, line.split())
        g[c][u - 1].append(v - 1)
        g[c][v - 1].append(u - 1)
    res = 0
    for link in range(0, 2):
        mark = [False] * n
        for u in range(0, n):
            if not mark[u] and len(g[link][u]) > 0:
                bfs(u, g[link], mark, cnt[link])
                res += cnt[link][u] * (cnt[link][u] - 1)
    for i in range(0, n):
        if cnt[0][i] > 0 and cnt[1][i] > 1:
            res += (cnt[0][i] - 1) * (cnt[1][i] - 1)
    print(int(res))
main()
def addEdge(arr: [], x, y):
    (x, y) = (getRoot(arr, x), getRoot(arr, y))
    if arr[x] <= arr[y]:
        arr[x] += arr[y]
        arr[y] = x
    else:
        arr[y] += arr[x]
        arr[x] = y

def getRoot(arr: [], id):
    while arr[id] > 0:
        id = arr[id]
    return id

def solve(zeroArr: [], oneArr: []):
    Ans = 0
    for i in range(1, len(zeroArr)):
        if zeroArr[i] < 0:
            Ans += zeroArr[i] * -1 * (zeroArr[i] * -1 - 1)
        if oneArr[i] < 0:
            Ans += oneArr[i] * -1 * (oneArr[i] * -1 - 1)
        if zeroArr[i] != -1 and oneArr[i] != -1:
            (one, zero) = (getRoot(oneArr, i), getRoot(zeroArr, i))
            Ans += (oneArr[one] * -1 - 1) * (zeroArr[zero] * -1 - 1)
    return Ans
n = int(input())
(zeroArr, oneArr) = ([-1] * (n + 1), [-1] * (n + 1))
while n > 1:
    (a, b, w) = [int(x) for x in input().split()]
    if w == 0:
        addEdge(zeroArr, a, b)
    else:
        addEdge(oneArr, a, b)
    n -= 1
print(solve(zeroArr, oneArr))
from collections import deque
from sys import stdin

def bfs(source, graph, mark, num, fcount):
    visited = [source]
    q = deque()
    mark[source] = True
    q.append(source)
    while q:
        u = q.popleft()
        for v in graph[u]:
            if not mark[v]:
                mark[v] = True
                visited.append(v)
                q.append(v)
    for u in visited:
        fcount[u] = len(visited)
n = int(stdin.readline())
g = [[[] for _ in range(0, n)] for _ in range(0, 2)]
cnt = [[0 for _ in range(0, n)] for _ in range(0, 2)]
for line in stdin.readlines():
    (u, v, c) = map(int, line.split())
    g[c][u - 1].append(v - 1)
    g[c][v - 1].append(u - 1)
res = 0
for link in range(0, 2):
    mark = [False] * n
    for u in range(0, n):
        if not mark[u] and len(g[link][u]) > 0:
            bfs(u, g[link], mark, link, cnt[link])
            res += cnt[link][u] * (cnt[link][u] - 1)
for i in range(0, n):
    if cnt[0][i] > 0 and cnt[1][i] > 1:
        res += (cnt[0][i] - 1) * (cnt[1][i] - 1)
print(int(res))