In paper 'The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree', the query model -- for a fixed graph G, we are asked queries to compute an approximate Steiner tree for a set S ⊆ V as fast as possible, was first defines in another paper that you've read. Provide the full name of that paper.