Constructs a supertree from a set of sourcetrees with overlaping leave sets.
The method is abel to deal with internal labels but produces an all or nothing supertree. This
means that the input trees have to be compatible, otherwise the algorithm is not able
to create a tree.