I am trying to reduce NOT-ALL-EQUAL SAT to MAX-CUT with weighted edges. I know that if there are weights to the edges, then I can reduce NOT-ALL-EQUAL SAT to MAX CUT by have a $G$ with $2n$ nodes ($x_i$ and $\bar{x}_i$) and edges between the nodes based on each clause. And, adding edges between $x_i$ and $\bar{x}_i$, so on.But, I am not sure how to assign weights if I have to reduce a NOT-ALL-EQUAL SAT to weighted MAX CUT. How should I go about this problem? 
NAE SAT reduction to weighted MAX CUT
complexity theory;reductions