import sys

def main():
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    adj = [[] for _ in range(N + 1)]  # 1-based indexing

    for _ in range(N - 1):
        a = int(input[idx])
        b = int(input[idx + 1])
        adj[a].append(b)
        adj[b].append(a)
        idx += 2

    leaves = []
    for i in range(1, N + 1):
        if len(adj[i]) == 1:
            leaves.append(i)

    if len(leaves) == 2:
        print("Yes")
    else:
        # Collect the neighbors of all leaves
        neighbor_set = set()
        for leaf in leaves:
            neighbor_set.add(adj[leaf][0])  # since each leaf has exactly one neighbor

        if len(neighbor_set) == 1:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    main()