  A graph in which all minimal zero forcing sets are in fact minimum size is
called ``well-forced." This paper characterizes well-forced trees and presents
an algorithm for determining which trees are well-forced. Additionally, we
characterize which vertices in a tree are contained in no minimal zero forcing
set.
