I am trying to compare minimum spanning trees through time. I have two questions: 1-Is it possible to measure the similarity between two minimum spanning trees with Gromov-Hausdorff distance measure when there is a probability of appearance assigned to each labeled vertex of the trees? It means some vertices might be absent (disappeared) in the future thus the size of the tree might be different. 2-If we knew the Gromov-Hausdorff distance between a known minimum spanning tree and an unknown minimum spanning tree, are we able to build the second tree? Are we able to extract any information about the structure of the second tree (e.g. its length) from the distance measure and the first known tree? Notice that the second tree might have smaller number of vertices due to absence of some vertex.