#include <bits/stdc++.h>
using namespace std;
int n, u, v;
vector<int> q[1510];
int x[1510], y[1510], fa[1510], siz[1510], ans[1510];
int s[1510], cnt;
struct node {
  double x;
  int flag, id;
};
bool cmp(node a, node b) {
  if (a.flag != b.flag) return a.flag < b.flag;
  return a.x < b.x;
}
void dfs(int now) {
  siz[now] = 1;
  for (int i = 0; i < q[now].size(); i++) {
    int to = q[now][i];
    if (to == fa[now]) continue;
    fa[to] = now;
    dfs(to);
    siz[now] += siz[to];
  }
}
void DFS(int h, int s[], int cnt) {
  node g1[1510];
  int tmp[1510];
  int len1 = 0, len2 = 0, f = s[1];
  for (int i = 1; i <= cnt; i++) {
    if (y[s[i]] < y[f]) f = s[i];
  }
  ans[f] = h;
  for (int j = 1; j <= cnt; j++) {
    int i = s[j];
    if (i == f) continue;
    double gg;
    int flag;
    if (x[i] == x[f])
      gg = (y[i] > y[f] ? 1 : -1) * 3e9;
    else
      gg = (y[i] - y[f]) * 1.0 / (x[i] - x[f]);
    if (x[i] - x[f] >= 0) flag = 1;
    if (x[i] - x[f] < 0) flag = 2;
    g1[++len1] = (node){gg, flag, i};
  }
  sort(g1 + 1, g1 + len1 + 1, cmp);
  int now = 0;
  for (int i = 0; i < q[h].size(); i++) {
    int to = q[h][i];
    if (to == fa[h]) continue;
    for (int j = 1; j <= siz[to]; j++) {
      tmp[j] = g1[++now].id;
    }
    if (siz[to] - 1 >= 0) DFS(to, tmp, siz[to]);
  }
  return;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &u, &v);
    q[u].push_back(v), q[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
  }
  for (int i = 1; i <= n; i++) s[++cnt] = i;
  dfs(1);
  DFS(1, s, n);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}

### Prompt

Please provide a Cpp coded solution 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, u, v;
vector<int> q[1510];
int x[1510], y[1510], fa[1510], siz[1510], ans[1510];
int s[1510], cnt;
struct node {
  double x;
  int flag, id;
};
bool cmp(node a, node b) {
  if (a.flag != b.flag) return a.flag < b.flag;
  return a.x < b.x;
}
void dfs(int now) {
  siz[now] = 1;
  for (int i = 0; i < q[now].size(); i++) {
    int to = q[now][i];
    if (to == fa[now]) continue;
    fa[to] = now;
    dfs(to);
    siz[now] += siz[to];
  }
}
void DFS(int h, int s[], int cnt) {
  node g1[1510];
  int tmp[1510];
  int len1 = 0, len2 = 0, f = s[1];
  for (int i = 1; i <= cnt; i++) {
    if (y[s[i]] < y[f]) f = s[i];
  }
  ans[f] = h;
  for (int j = 1; j <= cnt; j++) {
    int i = s[j];
    if (i == f) continue;
    double gg;
    int flag;
    if (x[i] == x[f])
      gg = (y[i] > y[f] ? 1 : -1) * 3e9;
    else
      gg = (y[i] - y[f]) * 1.0 / (x[i] - x[f]);
    if (x[i] - x[f] >= 0) flag = 1;
    if (x[i] - x[f] < 0) flag = 2;
    g1[++len1] = (node){gg, flag, i};
  }
  sort(g1 + 1, g1 + len1 + 1, cmp);
  int now = 0;
  for (int i = 0; i < q[h].size(); i++) {
    int to = q[h][i];
    if (to == fa[h]) continue;
    for (int j = 1; j <= siz[to]; j++) {
      tmp[j] = g1[++now].id;
    }
    if (siz[to] - 1 >= 0) DFS(to, tmp, siz[to]);
  }
  return;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &u, &v);
    q[u].push_back(v), q[v].push_back(u);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
  }
  for (int i = 1; i <= n; i++) s[++cnt] = i;
  dfs(1);
  DFS(1, s, n);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}

```