C.\,A. Barefoot, et. al. [6] introduced the concept of the integrity of a graph. It is an useful measure of vulnerability and it is defined as follows. $I(G)=\min\{|S|+m(G-S):S\subseteq V(G)\} $ where $m(G-S)$ denotes the order of the largest component in $G-S\}$. Unlike the connectivity measures, integrity shows not only the difficulty to break down the network but also the damage that has been caused. A subset $S$ of $V(G)$ is said to be an $I$-set if $I(G)=|S|+m(G-S)$. We define the concept of Domination Integrity of a graph $G$ is defined as $DI(G)=\min\{|S|+m(G-S)$: where $S$ is a dominating set of $G$ and $m(G-S)$ denotes the order of the largest component in $G-S\}$ and is denoted by $DI(G)$. In this paper, we found the Domination Integrity in trees.