My Lime Orange Tree

Mingming, the lime orange tree that Zeze cherishes, is a connected graph with $N$ vertices and $N-1$ edges. Edge $i$ of Mingming has $a_i$ lime oranges on it. Zeze and Portuga want to play a game on Mingming. On the first turn, Zeze places a piece on vertex $r$, the root of Mingming. On each turn, the two players repeat the following steps.

• Choose any edge adjacent to the vertex where the piece is.
• Pick at least one lime orange from the chosen edge.
• Move the piece to the vertex on the other end of the chosen edge.

When a player cannot continue, that is, when no edge adjacent to the piece's vertex has a lime orange left to pick, that player loses the game. For $r = 1, 2, \cdots, N$, write a program that prints "Zeze" if Zeze wins and "Portuga" if Portuga wins, without quotes.

The first line contains $N$, the number of vertices of Mingming.

From the second line to line $N$, each of the $N-1$ lines gives $x_i$, $y_i$, and $a_i$ in the form $x_i$ $y_i$ $a_i$, where $x_i$ and $y_i$ are the endpoints of edge $i$ and $a_i$ is the number of lime oranges on it.

For $r = 1, 2, \cdots, N$, print "Zeze" if Zeze wins or "Portuga" if Portuga wins, without quotes, on $N$ separate lines.

• $1 \le N \le 3 \times 10^5$
• $1 \le a_i \le 10^9$