#include <bits/stdc++.h>
using namespace std;
pair<pair<long long, long long>, long long> p[2000];
pair<long long, long long> tmp;
vector<long long> v[2000];
long long n, sz[2000], ans[2000];
void dfs(long long root, long long par) {
  sz[root] = 1;
  for (auto child : v[root])
    if (child != par) {
      dfs(child, root);
      sz[root] += sz[child];
    }
}
bool cmp(pair<pair<long long, long long>, long long> a,
         pair<pair<long long, long long>, long long> b) {
  long long res = (a.first.first - tmp.first) * (b.first.second - tmp.second) -
                  (a.first.second - tmp.second) * (b.first.first - tmp.first);
  return res > 0;
}
void go(long long L, long long R, long long root, long long par) {
  for (long long i = L + 1; i <= R; i++)
    if (p[i].first.second < p[L].first.second ||
        (p[i].first.second == p[L].first.second &&
         p[i].first.first < p[L].first.first))
      swap(p[i], p[L]);
  ans[p[L].second] = root;
  tmp = p[L].first;
  sort(p + L + 1, p + R + 1, cmp);
  long long pos = L + 1;
  for (auto child : v[root])
    if (child != par) {
      go(pos, pos + sz[child] - 1, child, root);
      pos += sz[child];
    }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (long long i = 1; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  for (long long i = 1; i <= n; i++) {
    cin >> p[i].first.first >> p[i].first.second;
    p[i].second = i;
  }
  dfs(1, 1);
  go(1, n, 1, 1);
  for (long long i = 1; i <= n; i++) cout << ans[i] << ' ';
  cout << endl;
  return 0;
}

### Prompt

Generate 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>
using namespace std;
pair<pair<long long, long long>, long long> p[2000];
pair<long long, long long> tmp;
vector<long long> v[2000];
long long n, sz[2000], ans[2000];
void dfs(long long root, long long par) {
  sz[root] = 1;
  for (auto child : v[root])
    if (child != par) {
      dfs(child, root);
      sz[root] += sz[child];
    }
}
bool cmp(pair<pair<long long, long long>, long long> a,
         pair<pair<long long, long long>, long long> b) {
  long long res = (a.first.first - tmp.first) * (b.first.second - tmp.second) -
                  (a.first.second - tmp.second) * (b.first.first - tmp.first);
  return res > 0;
}
void go(long long L, long long R, long long root, long long par) {
  for (long long i = L + 1; i <= R; i++)
    if (p[i].first.second < p[L].first.second ||
        (p[i].first.second == p[L].first.second &&
         p[i].first.first < p[L].first.first))
      swap(p[i], p[L]);
  ans[p[L].second] = root;
  tmp = p[L].first;
  sort(p + L + 1, p + R + 1, cmp);
  long long pos = L + 1;
  for (auto child : v[root])
    if (child != par) {
      go(pos, pos + sz[child] - 1, child, root);
      pos += sz[child];
    }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (long long i = 1; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  for (long long i = 1; i <= n; i++) {
    cin >> p[i].first.first >> p[i].first.second;
    p[i].second = i;
  }
  dfs(1, 1);
  go(1, n, 1, 1);
  for (long long i = 1; i <= n; i++) cout << ans[i] << ' ';
  cout << endl;
  return 0;
}

```