The Aldous-Broder algorithm allows one to sample the uniform spanning tree of a finite graph as the set of first-entry edges of a simple random walk. In this talk, I will discuss how this can be extended to infinite transient graphs by replacing the random walk with the random interlacement process. I will then outline how this new sampling algorithm can be used to compute critical exponents for the uniform spanning forest of $Z^d$.