N=int(input())
par=[i for i in range(N)]
rank=[0]*(N)
B=[0]*N
A=[]
block=[0]*N
size=[1]*N
def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
 
#同じ集合か判定
def same(x,y):
  return find(x)==find(y)
 
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
 
 
for i in range(N-1):
  a,b=map(int,input().split())
  union(a,b)
  B[a]+=1
  B[b]+=1
  A.append((a,b))
D=[]
for i in range(N):
  D.append(find(i))
D=list(set(D))
if len(D)==1:
  print('Bob')
elif len(D)>2:
  print('Alice')
else:
  if 1 in B:
    print('Alice')
  else:
    print('Bob')