#include<stdio.h>

int
int f[nmax][nmax]; //->vector de fii

int trace(int i, int s) //merge pe arbore in sus pana la stramosul Ki
{
 for(i=1;i<=;i++)
      s=t[s];
 return s;         
}

void BFS()
{
     
}

int main()
{
 freopen("cerere.in", "r", stdin);   
 freopen("cerere.out", "w", stdout);
 
 scanf("%d", &n);
 
 for(i=1;i<=n;i++)
    scanf("%d" , &a[i]);
    
 for(i=1;i<n;i++)
    {
     scanf("%d %d", &x, &y);
     t[y]=x;
     f[x][0]++; //->retine cati fi are
     f[f[x][0]]=y; //->retine fii
     }
 
  
 while(p<=u)
   
 
    
 return 0;
}