Find the maximum independent set of a tree

Question

Can anyone help me with this algorithm? I know how to find the actual max sum of an independent set for a tree:

    int[] picked = new int[t.noOfVertices];