 Solution

The Aldous-Broder algorithm starts the recurrent random walk at $x_0$ and, whenever it first visits a vertex $v\ne x_0$, adds the edge by which it entered $v$. Recurrence ensures that every vertex is eventually visited. The collection of first-entrance edges is a spanning tree and has the infinite-volume uniform spanning-tree law.