Grabbing the gold

Imagine a tree with some integer amount of gold at each vertex. Two players can play a game by taking turns removing leaves one by one and taking the gold from those leaves. We prove a recent conjecture of Micek and Walczak that says that if a tree has an even number of vertices, the first player can always secure at least half of the gold.