import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    n = scan()
    es = newseqwith(n,newseq[int]())
    mv = -1
  for i in 0..<n-1:
    var
      a = scan()-1
      b = scan()-1
    es[a].add(b)
    es[b].add(a)
    # 枝分かれがある
    if es[a].len>2:
      mv = a
    if es[b].len>2:
      mv = b
  #echo es.join("\n")
  proc dfs(par,p:int):int=
    if es[p].len==1:
      return 1
    else:
      for nxt in es[p]:
        if par == nxt:continue
        return 1+dfs(p,nxt)

  # 葉が2枚しかない場合は可能
  if es.filterIt(it.len==1).len==2:
    echo "Yes"
  # 枝分かれしている頂点が一つしかない
  # 一つしかないならmvがそれに該当する
  elif es.filterIt(it.len>2).len==1:
    #echo "mv:", mv
    var t = initHashSet[int]()
    for nxt in es[mv]:
      #echo mv,",",nxt,",", dfs(mv,nxt)
      t.incl(dfs(mv,nxt))
    if t.len==1:
      echo "Yes"
    else:
      echo "No"
  elif n == 1:
    echo "Yes"
  else:
    echo "No"
  
        


  
solve()