#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> G[100005];
int Res[100005];
pair<pair<int, int>, int> P[100005];
int Sz[100005];
pair<int, int> p;
void Read() {
  scanf("%d", &N);
  for (int i = 1; i < N; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    G[x].push_back(y);
    G[y].push_back(x);
  }
  for (int i = 1; i <= N; i++) {
    scanf("%d%d", &P[i].first.first, &P[i].first.second);
    P[i].second = i;
  }
}
void DFS(int node, int father) {
  Sz[node] = 1;
  for (int i = 0; i < G[node].size(); i++) {
    int neighb = G[node][i];
    if (neighb == father) continue;
    DFS(neighb, node);
    Sz[node] += Sz[neighb];
  }
}
inline bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  pair<int, int> q = a.first, r = b.first;
  return (1LL * (q.first - p.first) * (r.second - p.second)) >
         (1LL * (q.second - p.second) * (r.first - p.first));
}
void Solve(int node, int father, int L, int R) {
  pair<int, int> Min = make_pair(1000000005, 1000000005);
  int pos = 0;
  for (int i = L; i <= R; i++) {
    if (Min > P[i].first) {
      Min = P[i].first;
      pos = i;
    }
  }
  p = Min;
  swap(P[L], P[pos]);
  sort(P + L + 1, P + R + 1, cmp);
  Res[P[L].second] = node;
  ++L;
  for (int i = 0; i < G[node].size(); i++) {
    int neighb = G[node][i];
    if (neighb == father) continue;
    Solve(neighb, node, L, L + Sz[neighb] - 1);
    L += Sz[neighb];
  }
}
int main() {
  Read();
  DFS(1, 0);
  Solve(1, 0, 1, N);
  for (int i = 1; i <= N; i++) printf("%d ", Res[i]);
  printf("\n");
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

You 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 ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the numbers of tree vertexes connected by the i-th edge.

Each of the next n lines contain two space-separated integers xi and yi ( - 109 ≤ xi, yi ≤ 109) — 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.

<image> <image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> G[100005];
int Res[100005];
pair<pair<int, int>, int> P[100005];
int Sz[100005];
pair<int, int> p;
void Read() {
  scanf("%d", &N);
  for (int i = 1; i < N; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    G[x].push_back(y);
    G[y].push_back(x);
  }
  for (int i = 1; i <= N; i++) {
    scanf("%d%d", &P[i].first.first, &P[i].first.second);
    P[i].second = i;
  }
}
void DFS(int node, int father) {
  Sz[node] = 1;
  for (int i = 0; i < G[node].size(); i++) {
    int neighb = G[node][i];
    if (neighb == father) continue;
    DFS(neighb, node);
    Sz[node] += Sz[neighb];
  }
}
inline bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  pair<int, int> q = a.first, r = b.first;
  return (1LL * (q.first - p.first) * (r.second - p.second)) >
         (1LL * (q.second - p.second) * (r.first - p.first));
}
void Solve(int node, int father, int L, int R) {
  pair<int, int> Min = make_pair(1000000005, 1000000005);
  int pos = 0;
  for (int i = L; i <= R; i++) {
    if (Min > P[i].first) {
      Min = P[i].first;
      pos = i;
    }
  }
  p = Min;
  swap(P[L], P[pos]);
  sort(P + L + 1, P + R + 1, cmp);
  Res[P[L].second] = node;
  ++L;
  for (int i = 0; i < G[node].size(); i++) {
    int neighb = G[node][i];
    if (neighb == father) continue;
    Solve(neighb, node, L, L + Sz[neighb] - 1);
    L += Sz[neighb];
  }
}
int main() {
  Read();
  DFS(1, 0);
  Solve(1, 0, 1, N);
  for (int i = 1; i <= N; i++) printf("%d ", Res[i]);
  printf("\n");
  return 0;
}

```