suppose we have a tree(undirected) with $n$ vertices.The edges are weighted(distances). Is it possible to impose a semimetric structure on the graph using these distances and adjacency matrix?

Yes, it is possible. If we define the distance between two vertices in a graph as being the smallest sum of the weights of the edges connecting both, that would form a metric (if the graph is connected). 

