0-1 Knapsack Problem Python: Why are we returning the max value

Question

# A naive recursive implementation 
# of 0-1 Knapsack Problem 
  
# Returns the maximum value that  
# can be put in a knapsack of  
# capacity W 
def knapSack(W, wt, va