Abstract. Let F be a set of relational trees and let Forb h (F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature σ. There is a natural way to expand Forb h (F) by unary relations to an amalgamation class. This expanded class, enhanced with a linear ordering, has the Ramsey property. Both forbidden trees and Ramsey properties have previously been linked to the complexity of constraint satisfaction problems.