from collections import deque
N=int(input())
def root(n):

  if ne[n]<0:return n
  else:
    ne[n]=root(ne[n])
    return ne[n]
ne=[-1]*N
def merge(x,y):
  x,y=root(x),root(y)
  if x==y:return
  if y<x:y,x=x,y
  ne[x]+=ne[y]
  ne[y]=x
a=[0]*N
for _ in range(N-1):
  u,v=map(int,input().split())
  merge(u,v)
  a[u]+=1
  a[v]+=1
v=set()
for i in range(N):
  v.add(root(i))
a.sort()
if len(v)==1:
  print("Bob")
elif len(v)==2 and a[1]>1:
    print("Bob")
else:
  print("Alice")