###スニペット始まり###
import sys, re
from copy import copy, deepcopy
from math import ceil, floor, sqrt,factorial, gcd, pi, degrees, radians, sin, asin, cos, acos, tan, atan2
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import permutations, accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce, lru_cache
from string import ascii_uppercase, ascii_lowercase
from decimal import Decimal, ROUND_HALF_UP #四捨五入用

def input(): return sys.stdin.readline().rstrip('\n')
#easy-testのpypyでは再帰数を下げる。
if __file__=='prog.py':
    sys.setrecursionlimit(10**5)
else:
    sys.setrecursionlimit(10**6)

def lcm(a, b): return a * b // gcd(a, b)

#3つ以上の最大公約数/最小公倍数
def gcd_v2(l: list): return reduce(gcd, l)
def lcm_v2(l: list): return reduce(lcm, l)

#nPk
def nPk(n, k): return factorial(n) // factorial(n - k)

#逆元
def modinv(a, mod=10**9+7): return pow(a, mod-2, mod)
INF = float('inf')
MOD = 10 ** 9 + 7
###スニペット終わり###
N=int(input())
graph = [[] for _ in range(N)]
for _ in range(N-1):
    a, b = map(int, input().split())
    graph[a-1].append(b-1)
    graph[b-1].append(a-1)  # 有向グラフなら消す

dists=[-1]*N
def dfs(s, dist):
    dists[s]=dist
    for v in graph[s]:
        if dists[v]==-1:
            dfs(v, dist+1)
dfs(0,0)

s=dists.index(max(dists)) #0から一番遠い点を求める。
dists=[-1]*N
prev=defaultdict(int)
def dfs2(s, dist):
    dists[s]=dist
    for v in graph[s]:
        if dists[v]==-1:
            dfs2(v, dist+1)
            prev[v]=s
dfs2(s,0)
diam=max(dists) #直径
diam_leaf=dists.index(diam) #直径の末端。

if diam%2!=0:
    leaf_cnt=0
    if dists.count(diam)==1:
        #もし、葉がひとつならYes
        print('Yes')
    else:
        print('No')
else:
    #直径が偶数なら可能性あり。
    #まずは中心を求める。
    center=diam_leaf
    for _ in range(diam//2):
        center=prev[center]
    dist_set=set()
    visited=[False]*N
    def dfs3(s, dist):
        visited[s]=True
        flag=True
        for v in graph[s]:
            if not visited[v]:
                flag=False
                dfs3(v, dist+1)
        if flag:
            dist_set.add(dist)
    dfs3(center,0)
    if len(dist_set)==1:
        print('Yes')
    else:
        print('No')