A total global dominator coloring of a graph G is a proper vertex coloring of G with respect to which every vertex v in V dominates a color class, not containing v and does not dominate another color class. The minimum number of colors required in such a coloring of G is called the total global dominator chromatic number, denoted by χtgd(G). In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.