#include <bits/stdc++.h>
using namespace std;
bool used[1546];
vector<int> v[1546];
int p[1546];
int cnt[1546];
int ans[1546];
int pnt[1546];
int ver[1546];
int x[1546], y[1546];
void dfs(int e, int par) {
  p[e] = par;
  cnt[e] = 1;
  for (int i = 0; i < v[e].size(); i++)
    if (v[e][i] != par) {
      dfs(v[e][i], e);
      cnt[e] += cnt[v[e][i]];
    }
}
int cx, cy;
bool cmp(const int& a, const int& b) {
  long long ax = x[a] - cx;
  long long bx = x[b] - cx;
  long long ay = y[a] - cy;
  long long by = y[b] - cy;
  return ax * by - ay * bx < 0;
}
void solve(int e, int l, int r) {
  int best = l;
  for (int i = l; i < r; i++) {
    if (x[pnt[i]] < x[pnt[best]] ||
        (x[pnt[i]] == x[pnt[best]] && y[pnt[i]] < y[pnt[best]])) {
      best = i;
    }
  }
  swap(pnt[l], pnt[best]);
  cx = x[pnt[l]];
  cy = y[pnt[l]];
  ver[l] = e;
  sort(pnt + l + 1, pnt + r, cmp);
  int cur = l + 1;
  for (int i = 0; i < v[e].size(); i++) {
    if (v[e][i] != p[e]) {
      solve(v[e][i], cur, cur + cnt[v[e][i]]);
      cur += cnt[v[e][i]];
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  dfs(0, -1);
  for (int i = 0; i < n; i++) pnt[i] = i;
  for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
  solve(0, 0, n);
  for (int i = 0; i < n; i++) ans[pnt[i]] = ver[i];
  for (int i = 0; i < n; i++) printf("%d ", ans[i] + 1);
  printf("\n");
}

### Prompt

In CPP, your task is to solve the following problem:

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;
bool used[1546];
vector<int> v[1546];
int p[1546];
int cnt[1546];
int ans[1546];
int pnt[1546];
int ver[1546];
int x[1546], y[1546];
void dfs(int e, int par) {
  p[e] = par;
  cnt[e] = 1;
  for (int i = 0; i < v[e].size(); i++)
    if (v[e][i] != par) {
      dfs(v[e][i], e);
      cnt[e] += cnt[v[e][i]];
    }
}
int cx, cy;
bool cmp(const int& a, const int& b) {
  long long ax = x[a] - cx;
  long long bx = x[b] - cx;
  long long ay = y[a] - cy;
  long long by = y[b] - cy;
  return ax * by - ay * bx < 0;
}
void solve(int e, int l, int r) {
  int best = l;
  for (int i = l; i < r; i++) {
    if (x[pnt[i]] < x[pnt[best]] ||
        (x[pnt[i]] == x[pnt[best]] && y[pnt[i]] < y[pnt[best]])) {
      best = i;
    }
  }
  swap(pnt[l], pnt[best]);
  cx = x[pnt[l]];
  cy = y[pnt[l]];
  ver[l] = e;
  sort(pnt + l + 1, pnt + r, cmp);
  int cur = l + 1;
  for (int i = 0; i < v[e].size(); i++) {
    if (v[e][i] != p[e]) {
      solve(v[e][i], cur, cur + cnt[v[e][i]]);
      cur += cnt[v[e][i]];
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  dfs(0, -1);
  for (int i = 0; i < n; i++) pnt[i] = i;
  for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
  solve(0, 0, n);
  for (int i = 0; i < n; i++) ans[pnt[i]] = ver[i];
  for (int i = 0; i < n; i++) printf("%d ", ans[i] + 1);
  printf("\n");
}

```