N = int(input())
G = [[] for _ in range(N)]
for _ in range(N-1):
    a,b = map(int,input().split())
    a-=1;b-=1 #0-index
    G[a].append(b); G[b].append(a)

L = []
def dfs1(v,par=-1): #jは次数
    L.append(v)
    for u in G[v]:
        if u == par: continue
        dfs1(u,v)
        break
        
for i in range(N):
    if len(G[i]) == 1:
        dfs1(i)
        break
#print(L)

if len(L) == N: print("Yes"); exit() #一直線

dic = {}
def dfs2(v,par,j):
    if j in dic:
        dic[j] += 1
    else:
        dic[j] = 1
    for u in G[v]:
        if u == par: continue
        dfs2(u,v,j+1)
    
if len(L)%2 != 0:
    NL = len(L)
    root = L[NL//2]
    dfs2(root,-1,0)
    idx = 1
    while idx in dic:
        if dic[idx] == dic[1]:
            idx += 1
            continue
        else:
            print("No");exit()
    print("Yes")
else:
    print("No")