Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Paint Tree

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a tree with *n* vertexes and *n* points on a plane, no three points lie on one straight line.

Your task is to paint the given tree on a plane, using the given points as vertexes.

That is, you should correspond each vertex of the tree to exactly one point and each point should correspond to a vertex. If two vertexes of the tree are connected by an edge, then the corresponding points should have a segment painted between them. The segments that correspond to non-adjacent edges, should not have common points. The segments that correspond to adjacent edges should have exactly one common point.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 1500) — the number of vertexes on a tree (as well as the number of chosen points on the plane).

Each of the next *n* - 1 lines contains two space-separated integers *u*_{i} and *v*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*, *u*_{i} ≠ *v*_{i}) — the numbers of tree vertexes connected by the *i*-th edge.

Each of the next *n* lines contain two space-separated integers *x*_{i} and *y*_{i} ( - 10^{9} ≤ *x*_{i}, *y*_{i} ≤ 10^{9}) — the coordinates of the *i*-th point on the plane. No three points lie on one straight line.

It is guaranteed that under given constraints problem has a solution.

Output

Print *n* distinct space-separated integers from 1 to *n*: the *i*-th number must equal the number of the vertex to place at the *i*-th point (the points are numbered in the order, in which they are listed in the input).

If there are several solutions, print any of them.

Examples

Input

3

1 3

2 3

0 0

1 1

2 0

Output

1 3 2

Input

4

1 2

2 3

1 4

-1 -2

3 5

-3 3

2 0

Output

4 2 1 3

Note

The possible solutions for the sample are given below.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/24/2020 12:40:33 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|