We supply (finite connected) spatial graphs with an additional structure - increased skeleton and disk framing of it, - such that the problem of the isotopic classification of spatial graphs endowed with this structure admits a 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 the additional structure - a set of hanging vertices and a fixed vertex (the root of the tree) in this set.