of these points inside their edges in Section \[sec:params\]. The statements of this section do not depend on the choices made in Section \[sec:params\].

We pick the following additional data: For every edge $e$, we label one of its endpoints $v(e)$ and the other one $w(e)$ and we pick for each edge $e$ a positive integer $s(e)$. We will describe which vertex is $v(e)$ and which is $w(e)$ in Section \[sec:params\] along with conditions for the integers $s(e)$.

Let $\{e_1, \dots, e_g\}$ be the edges not in the spanning tree $T$ and note that the following divisors are all principal $$\begin{aligned}
D_1 &= \sum_{e \in E} v(e) + w(e) - p_e - q_e, \\
D_2 &= \sum_{e \in E} s(e) \left( v(e) + w(e) - p_e - q_e \right) + 
\sum_{i = 1}^g -c_{e_i} + a_{e_i} + b_{e_i} - d_{e_i}, \\
D_3 &= \sum_{e \in E} a_e - b_e.\end{aligned}$$ Let $F_i$ be a piecewise-linear function such that $\operatorname{div}(F_i) = D_i$. The graphs of $F_i$ are depicted in Figures \[fig:F1-graph\], \[fig:F3-graph\], \[fig:F2-graphT’\] and \[fig:F2-graphT\]. Our graphs look similar to the graphs of the functions used by Baker and Rabinoff (and depicted in [@BR Figure 1]), however they are tweaked to fit 