We consider the Graph Ornstein-Uhlenbeck (GrOU) process observed on a non-uniform discrete timegrid and introduce discretised maximum likelihood estimators with parameters specific to the whole graph or specific to each component of the graph. Under a high-frequency sampling scheme, we study the asymptotic behaviour of those estimators as the mesh size of the observation grid goes to zero. We prove two stable central limit theorems to the same distribution as in the continuously-observed case under both finite and infinite jump activity for the Lévy driving noise. In addition to providing the consistency of the estimators, the stable convergence allows us to consider probabilistic sparse inference procedures on the edges themselves when a graph structure is not explicitly available. It also preserves its asymptotic properties. In particular, we also show the asymptotic normality and consistency of an Adaptive Lasso scheme. We apply the new estimators to wind capacity factor measurements, i.e. the ratio between the wind power produced locally compared to its rated peak power, across fifty locations in Northern Spain and Portugal. We compare those estimators to the standard least squares estimator through a simulation study extending known univariate results across graph configurations, noise types and amplitudes.