All (finite connected) spatial graphs are supplied with an additional structure - the replenished skeleton and its disk framing, - in such a way that the problem of isotopic classification of spatial graphs endowed with this structure admits reduction to two problems: the (classical) problem of isotopic classification of tangles and the (close to classical) problem of isotopic classification of plane trees equipped with an additional structure, specifically, a set of hanging vertices and a fixed vertex (the root of the tree) in this set.