Models of random walks in a random environment were intro- duced at first by Chernoff in 1967 in order to study biological mechanisms. The original model has been intensively studied since then and is now well understood. In parallel, similar models of random processes in a random environment have been studied. In this article we focus on a model of ran- dom walk on random marked trees, following a model introduced by R. Lyons and R. Pemantle (1992). Our point of view is a bit different yet, as we consider a very general way of constructing random trees with random transition probabilities on them. We prove an analogue of R. Lyons and R. Pemantle's recurrence criterion in this setting, and we study precisely the asymptotic behavior, under restrictive assumptions. Our last result is a generalization of a result of Y. Peres and O. Zeitouni (2006) concerning biased random walks on Galton-Watson trees.