Representation of an arbitrary number with weight sum of essential subtrees

An algorithm for representation of arbitrary number of code words with sum of essential subtrees weights in the tree presenting all code words of $(m,n)$-code is suggested. Some properties of essential subtrees are determined.