The maximum value of $w_n$ is
$w_n = 3^n$
To see this, first note that
If we want to distinguish between $x$ and $x+1$, some combination of weights has to form a value in the interval $[x, x+1]$, otherwise those two values would give the same result for any weighing.
Generalizing for all $w_n$ values...
We need to be able to weigh exactly a value in $[1, 2]$, a value in $[2,3]$, a value in $[3,4]$,...
And the way to accomplish this with the least amount of weight combinations is
to cover two intervals with each single possible weighing combination, i.e. be able to weigh exactly $2$, $4$, $6$, ...
Knowing all of this, the biggest we can get is
With $n$ weights, we can weigh exactly at most $\displaystyle\sum_{i=0}^{n-1}3^i$ distinct positive values (as mentioned in the question).
This is because each weight has 3 possibilities: either it's used in the same pan as the weight we want to measure, or in the opposite pan or not at all, giving us $3^n$ possibilities. One of those is zero (from not placing any weight), and for each positive weight we can measure we can also measure a corresponding negative weight by swapping all weights from one pan to the other, so the total of distinct positive weights is $\frac{3^n-1}{2}$.
This means we can weigh at most $2$, $4$, ..., $2 \times \displaystyle\sum_{i=0}^{n-1}3^i$ exactly (by using the weights $2$, $6$, ... $2 \times 3^{n-1}$), being able to distinguish up to $w_n = 2 \times \displaystyle\sum_{i=0}^{n-1}3^i + 1 = 3^n$.