#include <bits/stdc++.h>
using namespace std;
const int N = 1600;
const double eps = 1e-9;
const int oo = 0x7f7f7f7f;
struct Node {
  pair<int, int> point;
  int idx;
} p[N];
struct Node2 {
  int to, next;
} edge[N << 1];
int n, ehead[N], ec, ans[N], id, son[N];
pair<int, int> s0;
bool flag[N];
void add_edge(int x, int y) {
  edge[ec].to = y;
  edge[ec].next = ehead[x];
  ehead[x] = ec++;
}
bool cmp(Node x, Node y) { return x.point < y.point; }
bool cmp2(Node x, Node y) {
  return (long long)(x.point.second - s0.second) * (y.point.first - s0.first) >
         (long long)(y.point.second - s0.second) * (x.point.first - s0.first);
}
void init() {
  ec = 0;
  memset(ehead, -1, sizeof(ehead));
  scanf("%d", &n);
  for (int i = 1; i < n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    add_edge(x, y);
    add_edge(y, x);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &p[i].point.first, &p[i].point.second);
    p[i].idx = i;
  }
  memset(flag, 0, sizeof(flag));
  flag[1] = true;
}
void dfs(int x) {
  son[x] = 1;
  for (int p = ehead[x]; p != -1; p = edge[p].next)
    if (!flag[edge[p].to]) {
      int y = edge[p].to;
      flag[y] = true;
      dfs(y);
      son[x] += son[y];
    }
}
void solve(int x, int s, int e) {
  int u = s, ss = s + 1;
  for (int i = s + 1; i <= e; ++i) {
    if (cmp(p[i], p[u])) {
      u = i;
    }
  }
  swap(p[s], p[u]);
  ans[p[s].idx] = x;
  s0 = p[s].point;
  if (s + 1 <= e) {
    sort(p + s + 1, p + e + 1, cmp2);
  }
  for (int pp = ehead[x]; pp != -1; pp = edge[pp].next)
    if (!flag[edge[pp].to]) {
      int y = edge[pp].to;
      flag[y] = true;
      solve(y, ss, ss + son[y] - 1);
      ss += son[y];
    }
}
void print() {
  for (int i = 1; i <= n; ++i) {
    printf("%d%c", ans[i], i < n ? ' ' : '\n');
  }
}
int main() {
  init();
  dfs(1);
  memset(flag, 0, sizeof(flag));
  flag[1] = true;
  solve(1, 1, n);
  print();
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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 N = 1600;
const double eps = 1e-9;
const int oo = 0x7f7f7f7f;
struct Node {
  pair<int, int> point;
  int idx;
} p[N];
struct Node2 {
  int to, next;
} edge[N << 1];
int n, ehead[N], ec, ans[N], id, son[N];
pair<int, int> s0;
bool flag[N];
void add_edge(int x, int y) {
  edge[ec].to = y;
  edge[ec].next = ehead[x];
  ehead[x] = ec++;
}
bool cmp(Node x, Node y) { return x.point < y.point; }
bool cmp2(Node x, Node y) {
  return (long long)(x.point.second - s0.second) * (y.point.first - s0.first) >
         (long long)(y.point.second - s0.second) * (x.point.first - s0.first);
}
void init() {
  ec = 0;
  memset(ehead, -1, sizeof(ehead));
  scanf("%d", &n);
  for (int i = 1; i < n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    add_edge(x, y);
    add_edge(y, x);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &p[i].point.first, &p[i].point.second);
    p[i].idx = i;
  }
  memset(flag, 0, sizeof(flag));
  flag[1] = true;
}
void dfs(int x) {
  son[x] = 1;
  for (int p = ehead[x]; p != -1; p = edge[p].next)
    if (!flag[edge[p].to]) {
      int y = edge[p].to;
      flag[y] = true;
      dfs(y);
      son[x] += son[y];
    }
}
void solve(int x, int s, int e) {
  int u = s, ss = s + 1;
  for (int i = s + 1; i <= e; ++i) {
    if (cmp(p[i], p[u])) {
      u = i;
    }
  }
  swap(p[s], p[u]);
  ans[p[s].idx] = x;
  s0 = p[s].point;
  if (s + 1 <= e) {
    sort(p + s + 1, p + e + 1, cmp2);
  }
  for (int pp = ehead[x]; pp != -1; pp = edge[pp].next)
    if (!flag[edge[pp].to]) {
      int y = edge[pp].to;
      flag[y] = true;
      solve(y, ss, ss + son[y] - 1);
      ss += son[y];
    }
}
void print() {
  for (int i = 1; i <= n; ++i) {
    printf("%d%c", ans[i], i < n ? ' ' : '\n');
  }
}
int main() {
  init();
  dfs(1);
  memset(flag, 0, sizeof(flag));
  flag[1] = true;
  solve(1, 1, n);
  print();
  return 0;
}

```