We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when the bias converges to its critical value is conjectured to coincide with the weak limit of the uniform SAW. Along the way, we obtain a criterion for the continuity of the escape probability of a biased random walk on tree as a function of the bias, and show that the collection of escape probability functions for spherically symmetric trees of bounded degree is stable under uniform convergence.