#include <bits/stdc++.h>
using namespace std;
const int len = 2000;
int n, x, y;
struct node {
  int xx, yy, d;
  bool operator<(const node &a) const {
    if (xx - x >= 0 && a.xx - x <= 0) return 1;
    if (xx - x <= 0 && a.xx - x >= 0) return 0;
    return (yy - y) * (long long)(a.xx - x) < (a.yy - y) * (long long)(xx - x);
  }
} p[len];
vector<int> g[len];
bool vis[len];
int w[len], point[len];
int dfs(int u) {
  vis[u] = true;
  w[u] = 1;
  int ret = 0;
  int v;
  for (int i = 0; i < g[u].size(); i++) {
    v = g[u][i];
    if (vis[v]) continue;
    ret += dfs(v);
  }
  w[u] += ret;
  return w[u];
}
void work(int u, int l, int r) {
  vis[u] = true;
  int t = l;
  for (int i = l + 1; i <= r; i++) {
    if ((p[i].yy < p[t].yy) || (p[t].yy == p[i].yy && p[i].xx < p[t].xx)) {
      t = i;
    }
  }
  if (t != l) {
    swap(p[l], p[t]);
  }
  point[p[l].d] = u;
  x = p[l].xx;
  y = p[l].yy;
  sort(p + l + 1, p + r + 1);
  int pos = l + 1;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (vis[v]) continue;
    work(v, pos, pos + w[v] - 1);
    pos += w[v];
  }
}
int main() {
  ios ::sync_with_stdio(false);
  cin >> n;
  int x, y;
  for (int i = 0; i < n - 1; i++) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    p[i] = (node){x, y, i};
  }
  dfs(1);
  memset(vis, 0, sizeof(vis));
  work(1, 1, n);
  for (int i = 1; i <= n; i++) {
    cout << point[i] << ' ';
  }
  cout << endl;
  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;
const int len = 2000;
int n, x, y;
struct node {
  int xx, yy, d;
  bool operator<(const node &a) const {
    if (xx - x >= 0 && a.xx - x <= 0) return 1;
    if (xx - x <= 0 && a.xx - x >= 0) return 0;
    return (yy - y) * (long long)(a.xx - x) < (a.yy - y) * (long long)(xx - x);
  }
} p[len];
vector<int> g[len];
bool vis[len];
int w[len], point[len];
int dfs(int u) {
  vis[u] = true;
  w[u] = 1;
  int ret = 0;
  int v;
  for (int i = 0; i < g[u].size(); i++) {
    v = g[u][i];
    if (vis[v]) continue;
    ret += dfs(v);
  }
  w[u] += ret;
  return w[u];
}
void work(int u, int l, int r) {
  vis[u] = true;
  int t = l;
  for (int i = l + 1; i <= r; i++) {
    if ((p[i].yy < p[t].yy) || (p[t].yy == p[i].yy && p[i].xx < p[t].xx)) {
      t = i;
    }
  }
  if (t != l) {
    swap(p[l], p[t]);
  }
  point[p[l].d] = u;
  x = p[l].xx;
  y = p[l].yy;
  sort(p + l + 1, p + r + 1);
  int pos = l + 1;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (vis[v]) continue;
    work(v, pos, pos + w[v] - 1);
    pos += w[v];
  }
}
int main() {
  ios ::sync_with_stdio(false);
  cin >> n;
  int x, y;
  for (int i = 0; i < n - 1; i++) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    cin >> x >> y;
    p[i] = (node){x, y, i};
  }
  dfs(1);
  memset(vis, 0, sizeof(vis));
  work(1, 1, n);
  for (int i = 1; i <= n; i++) {
    cout << point[i] << ' ';
  }
  cout << endl;
  return 0;
}

```