import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 8)

def dfs(cur, prev):
    if cur == None:
        exit()
        
    if cur < 0 or cur >= N:
        exit()
    res = 1
    
    for next_node, w in adj_list[cur]:
        if next_node == prev:
            continue
        res += dfs(next_node, cur)
    
    return res
    
N = int(input())
adj_list = [[] for _ in range(N)]
edges = []

for _ in range(N-1):
    ui, vi, wi = map(int, input().split())
    edges.append((ui-1, vi-1, wi))
    adj_list[ui-1].append((vi-1, wi))
    adj_list[vi-1].append((ui-1, wi))

dfs(0, None)
ans = 0