“…Let α ∈ (0, 1) and s ∈ (1, ∞). We define E w T (s, r, α) = sup E,F ⊂G |E|,|F |<∞ 1 w(F ) α M • s w(E) 1−α x∈E w (F ∩ S(x, r)) |S(x, r)| and S T (r) = sup x∈T |S(x, r)|.With these quantities at our disposal we are ready to settle our weighted version of[32, Theorem 4.1]. For every weight w on a tree T we have thatw ({x ∈ T : M • f (x) > λ}) Γ T,w,r,α,s 1 λ T |f(x)|M • s w(x)dx where Γ T,w,r,α,s = c α sup n∈N ∞ S T (r)≥2 n−1 E w T (s, r, α) 1 1−α S T (r) 1 and c α → +∞ when α → 0.…”