#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T, typename TT>
inline ostream &operator<<(ostream &os, const pair<T, TT> &t) {
  return os << t.first << " " << t.second;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &t) {
  for (auto i : t) os << i << " ";
  return os;
}
template <typename T>
inline istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) is >> t;
  return is;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &is, pair<T1, T2> &t) {
  is >> t.first >> t.second;
  return is;
}
const long long mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<vector<int>> v(n);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    v[a - 1].push_back(b - 1);
    v[b - 1].push_back(a - 1);
  }
  vector<array<long long, 3>> pts(n);
  for (int i = 0; i < n; i++) {
    cin >> pts[i][0] >> pts[i][1];
    pts[i][2] = i;
  }
  vector<int> ans(n), sub(n);
  function<void(int, int)> calc = [&](int u, int p) {
    sub[u] = 1;
    for (auto x : v[u]) {
      if (x != p) {
        calc(x, u);
        sub[u] += sub[x];
      }
    }
  };
  calc(0, -1);
  function<void(int, int, int, int)> recur = [&](int u, int p, int l, int r) {
    int id = min_element(pts.begin() + l, pts.begin() + r) - pts.begin();
    swap(pts[l], pts[id]);
    ans[pts[l][2]] = u + 1;
    sort(pts.begin() + l + 1, pts.begin() + r,
         [&](const array<long long, 3> &a,
             const array<long long, 3> &b) -> bool {
           return (a[0] - pts[l][0]) * (b[1] - pts[l][1]) -
                      (a[1] - pts[l][1]) * (b[0] - pts[l][0]) >
                  0;
         });
    int s = l + 1;
    for (auto x : v[u]) {
      if (x != p) {
        recur(x, u, s, s + sub[x]);
        s += sub[x];
      }
    }
  };
  recur(0, -1, 0, n);
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}

### Prompt

Please formulate a cpp solution to 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>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T, typename TT>
inline ostream &operator<<(ostream &os, const pair<T, TT> &t) {
  return os << t.first << " " << t.second;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &t) {
  for (auto i : t) os << i << " ";
  return os;
}
template <typename T>
inline istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) is >> t;
  return is;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &is, pair<T1, T2> &t) {
  is >> t.first >> t.second;
  return is;
}
const long long mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<vector<int>> v(n);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    v[a - 1].push_back(b - 1);
    v[b - 1].push_back(a - 1);
  }
  vector<array<long long, 3>> pts(n);
  for (int i = 0; i < n; i++) {
    cin >> pts[i][0] >> pts[i][1];
    pts[i][2] = i;
  }
  vector<int> ans(n), sub(n);
  function<void(int, int)> calc = [&](int u, int p) {
    sub[u] = 1;
    for (auto x : v[u]) {
      if (x != p) {
        calc(x, u);
        sub[u] += sub[x];
      }
    }
  };
  calc(0, -1);
  function<void(int, int, int, int)> recur = [&](int u, int p, int l, int r) {
    int id = min_element(pts.begin() + l, pts.begin() + r) - pts.begin();
    swap(pts[l], pts[id]);
    ans[pts[l][2]] = u + 1;
    sort(pts.begin() + l + 1, pts.begin() + r,
         [&](const array<long long, 3> &a,
             const array<long long, 3> &b) -> bool {
           return (a[0] - pts[l][0]) * (b[1] - pts[l][1]) -
                      (a[1] - pts[l][1]) * (b[0] - pts[l][0]) >
                  0;
         });
    int s = l + 1;
    for (auto x : v[u]) {
      if (x != p) {
        recur(x, u, s, s + sub[x]);
        s += sub[x];
      }
    }
  };
  recur(0, -1, 0, n);
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}

```