#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> s[1505];
struct P {
  int u, fa;
  vector<pair<int, int>> arr;
};
map<pair<int, int>, int> ma;
int SZ[1505];
int dfs(int u, int fa) {
  int cnt = 1;
  for (auto v : s[u]) {
    if (v == fa) continue;
    cnt += dfs(v, u);
  }
  return SZ[u] = cnt;
}
int ans[1505];
int mx, my;
double pi = acos(-1);
int cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int first, second;
    scanf("%d%d", &first, &second);
    s[first].push_back(second);
    s[second].push_back(first);
  }
  dfs(1, -1);
  vector<pair<int, int>> in;
  for (int i = 0; i < n; i++) {
    int first, second;
    scanf("%d%d", &first, &second);
    in.push_back({first, second});
    ma[in.back()] = i + 1;
  }
  sort(in.begin(), in.end(), cmp);
  queue<P> que;
  que.push({1, -1, in});
  while (que.size()) {
    P out = que.front();
    que.pop();
    ans[ma[out.arr[0]]] = out.u;
    if (out.arr.size() == 1) {
      continue;
    }
    mx = out.arr[0].first;
    my = out.arr[0].second;
    vector<pair<double, int>> arr;
    for (int i = 1; i < out.arr.size(); i++) {
      double deg = atan2(out.arr[i].second - my, out.arr[i].first - mx);
      arr.push_back({deg, i});
    }
    sort(arr.begin(), arr.end());
    int now = 0;
    for (auto v : s[out.u]) {
      if (v == out.fa) continue;
      vector<pair<int, int>> tmp;
      for (int i = 0; i < SZ[v]; i++) tmp.push_back(out.arr[arr[now++].second]);
      sort(tmp.begin(), tmp.end(), cmp);
      que.push({v, out.u, tmp});
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  puts("");
}

### 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;
int n;
vector<int> s[1505];
struct P {
  int u, fa;
  vector<pair<int, int>> arr;
};
map<pair<int, int>, int> ma;
int SZ[1505];
int dfs(int u, int fa) {
  int cnt = 1;
  for (auto v : s[u]) {
    if (v == fa) continue;
    cnt += dfs(v, u);
  }
  return SZ[u] = cnt;
}
int ans[1505];
int mx, my;
double pi = acos(-1);
int cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int first, second;
    scanf("%d%d", &first, &second);
    s[first].push_back(second);
    s[second].push_back(first);
  }
  dfs(1, -1);
  vector<pair<int, int>> in;
  for (int i = 0; i < n; i++) {
    int first, second;
    scanf("%d%d", &first, &second);
    in.push_back({first, second});
    ma[in.back()] = i + 1;
  }
  sort(in.begin(), in.end(), cmp);
  queue<P> que;
  que.push({1, -1, in});
  while (que.size()) {
    P out = que.front();
    que.pop();
    ans[ma[out.arr[0]]] = out.u;
    if (out.arr.size() == 1) {
      continue;
    }
    mx = out.arr[0].first;
    my = out.arr[0].second;
    vector<pair<double, int>> arr;
    for (int i = 1; i < out.arr.size(); i++) {
      double deg = atan2(out.arr[i].second - my, out.arr[i].first - mx);
      arr.push_back({deg, i});
    }
    sort(arr.begin(), arr.end());
    int now = 0;
    for (auto v : s[out.u]) {
      if (v == out.fa) continue;
      vector<pair<int, int>> tmp;
      for (int i = 0; i < SZ[v]; i++) tmp.push_back(out.arr[arr[now++].second]);
      sort(tmp.begin(), tmp.end(), cmp);
      que.push({v, out.u, tmp});
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  puts("");
}

```