The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V(G) can be partitioned so that each subset induces a subgraph whose connected components are trees. An integer distance graph is a graph G(D) with the set of all integers as vertex set and two vertices u, v\in Z are adjacent if and only if |u-v in D where the distance set D is a subset of the positive integers set. Let Dm, k, 2=[1,m]\k, 2k} for m>2k≥2. In this paper, some upper and lower bounds of the vertex arboricity of the integer distance graph G(Dm, k, 2) are obtained. Moreover, va(G(Dm,1, 2))=lm+4/5l for m≥4 and va(G(Dm, 2, 2))=lm+1/5l+1 for any positive integer m=10q+j with j =0,1, 2, 3, 5, 6.