On the complexity of the multicut problem in bounded tree-width graphs and digraphs