This paper adapts two well-known solutions of cooperative games with an exogenously given cycle-free communication graph structure (the average tree solution and the Myerson value) to the game with a major player. Such solutions are compared with one another for special graphs, namely, for a star and a complete k-ary tree.