MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

MAXN = 100005
G = [[] for _ in range(MAXN)]
visited = [0] * MAXN
def dfs(i):
    visited[i] = 1
    for e in G[i]:
        if visited[e]:
            continue
        dfs(e)

def main():
    n = int(input())
    inedge = [0] * n
    for _ in range(n - 1):
        a,b = map(int,input().split())
        G[a].append(b)
        G[b].append(a)
        inedge[a] += 1
        inedge[b] += 1
    
    cnt = 0
    for i in range(n):
        if visited[i] == 0:
            dfs(i)
            cnt += 1
    
    if cnt == 1:
        print('Bob')
        return
    elif cnt >= 3:
        print('Alice')
        return
    
    ans = 'Bob'
    for i in range(n):
        if inedge[i] == 1:
            ans = 'Alice'
            break
    print(ans) 

if __name__ =='__main__':
    main()