A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.