import sys
input=sys.stdin.readline

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


N = int(input())
#x,n,m = map(int,input().split())
#vA = list(map(int,input().split()))
#vB = list(map(int,input().split()))

cU = UnionFind(N)
vC = [0,]*N
for _ in [0,]*(N-1):
	A,B = map(int,input().split())
	cU.union(A,B)
	vC[A]+=1
	vC[B]+=1

#res = ""
g = cU.group_count()
if g==1:
	res = "Bob"
elif g==2:
	for x in vC:
		if x not in (0,2):
			res = "Alice"
			break
	else:
		res = "Bob"
else:
	res = "Alice"
#res = "Alice" if g > 1 else "Bob"
print(res)