In this paper we introduce the concept of signed tree domination in graphs,we obtain a upper bound and a lower bound of signed tree domination numbers for general graphs G,and show that the two bounds are best possible.In addition,we determine the signed tree domination numbers for some special classes of graphs G,including cycles,wheels,complete graphs and complete bipartite graphs.