Bounded Repairability for Regular Tree Languages