func_code_string: #include <bits/stdc++.h>   using namespace std;   template <typename T, typename U>   inline void smin(T &a, U b) {     if (a > b) a = b;   }   template <typename T, typename U>   inline void smax(T &a, U b) {     if (a < b) a = b;   }   template <typename T>   inline void gn(T &first) {     char c, sg = 0;     while (c = getchar(), (c >  9  || c <  0 ) && c !=  - )       ;     for ((c ==  -  ? sg = 1, c = getchar() : 0), first = 0; c >=  0  && c <=  9 ;          c = getchar())       first = (first << 1) + (first << 3) + c -  0 ;     if (sg) first = -first;   }   template <class T, class T1>   inline void gn(T &first, T1 &second) {     gn(first);     gn(second);   }   template <class T, class T1, class T2>   inline void gn(T &first, T1 &second, T2 &z) {     gn(first);     gn(second);     gn(z);   }   template <typename T>   inline void print(T first) {     if (first < 0) {       putchar( - );       return print(-first);     }     if (first < 10) {       putchar( 0  + first);       return;     }     print(first / 10);     putchar(first % 10 +  0 );   }   template <typename T>   inline void println(T first) {     print(first), putchar(  n );   }   template <typename T>   inline void printsp(T first) {     print(first), putchar(   );   }   template <class T, class T1>   inline void print(T first, T1 second) {     printsp(first), println(second);   }   template <class T, class T1, class T2>   inline void print(T first, T1 second, T2 z) {     printsp(first), printsp(second), println(z);   }   int power(int a, int b, int m, int ans = 1) {     for (; b; b >>= 1, a = 1LL * a * a % m)       if (b & 1) ans = 1LL * ans * a % m;     return ans;   }   int first[1555], second[1555];   int ans[1555], sz[1555];   vector<int> adj[1555];   void dfs(int u, int fa = -1) {     sz[u] = 1;     for (int i = 0; i < adj[u].size(); i++) {       int v = adj[u][i];       if (v == fa) continue;       dfs(v, u);       sz[u] += sz[v];     }   }   long double alp[1555][1555];   int id0;   bool cmp(int u, int v) { return alp[u][id0] + 1e-14 < alp[v][id0]; }   int id[1555];   void solve(int u, int fa, int *id, int n) {     if (n == 1) {       ans[id[0]] = u;       return;     }     for (int i = 1; i < n; i++) {       if (second[id[i]] < second[id[0]]) swap(id[0], id[i]);     }     ans[id[0]] = u;     id0 = id[0];     sort(id + 1, id + n, cmp);     int st = 1;     for (int i = 0; i < adj[u].size(); i++) {       int v = adj[u][i];       if (v == fa) continue;       solve(v, u, id + st, sz[v]);       st += sz[v];     }   }   int main() {     srand(time(NULL));     int n;     gn(n);     for (int i = 1; i < n; i++) {       int u, v;       gn(u, v);       u--;       v--;       adj[u].push_back(v);       adj[v].push_back(u);     }     int u = rand() % n;     dfs(u);     for (int i = 0; i < n; i++) gn(first[i], second[i]);     for (int i = 0; i < n; i++) {       for (int j = 0; j < n; j++)         if (i != j)           alp[i][j] = atan2l(second[j] - second[i], first[j] - first[i]);     }     for (int i = 0; i < n; i++) id[i] = i;     solve(u, -1, id, n);     for (int i = 0; i < n; i++) printsp(ans[i] + 1);     return 0;   }   