#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline int read()
{int x,f=1;char c;while((c=getchar())<'0'||c>'9')if(c=='-')f=0;for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=(x<<3)+(x<<1)+c-'0';return f?x:-x;
}
#define MN 300000
#define N 524288
struct edge{int nx,t;}e[MN*2+5];
int t[N*2+5],h[MN+5],en;
inline void ins(int x,int y)
{e[++en]=(edge){h[x],y};h[x]=en;e[++en]=(edge){h[y],x};h[y]=en;
}
void add(int k,int x){for(t[k+=N]+=x;k>>=1;)t[k]=max(t[k<<1],t[k<<1|1]);}
int main()
{int n=read(),i,j,ans=0x7FFFFFFF;memset(t,128,sizeof(t));for(i=1;i<=n;++i)t[i+N]=read()+2;for(i=N;--i;)t[i]=max(t[i<<1],t[i<<1|1]);for(i=1;i<n;++i)ins(read(),read());for(i=1;i<=n;++i){add(i,-2);for(j=h[i];j;j=e[j].nx)add(e[j].t,-1);ans=min(ans,t[1]);add(i,2);for(j=h[i];j;j=e[j].nx)add(e[j].t,1);}printf("%d",ans);
}

#include<cstdio>
inline int read()
{int x;char c;while((c=getchar())<'0'||c>'9');for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0';return x;
}
#define MN 300000
struct edge{int nx,t;}e[MN*2+5];
int h[MN+5],en=1,q[MN+5],qn,u[MN+5],f[MN+5],cnt,ans[MN+5];
inline void ins(int x,int y)
{e[++en]=(edge){h[x],y};h[x]=en;e[++en]=(edge){h[y],x};h[y]=en;
}
int main()
{int n,k,d,i,j;n=read();k=read();d=read();for(i=1;i<=k;++i)u[j=read()]?0:u[q[++qn]=j]=1;for(i=1;i<n;++i)ins(read(),read());for(i=1;i<=qn;++i)for(j=h[q[i]];j;j=e[j].nx)if(e[j].t!=f[q[i]])if(u[e[j].t])ans[j>>1]?0:(++cnt,ans[j>>1]=1);else u[q[++qn]=e[j].t]=1,f[e[j].t]=q[i];printf("%d\n",cnt);for(i=1;i<n;++i)if(ans[i])printf("%d ",i);
}

#include<cstdio>
#include<cstring>
inline int read()
{int x;char c;while((c=getchar())<'0'||c>'9');for(x=c-'0';(c=getchar())>='0'&&c<='9';)x=x*10+c-'0';return x;
}
#define MN 1000
#define MK 50
int a[MN+5],b[MN+5],f[2][MN+5][MK+5][MK+5];
inline void up(int&a,int b){if(b>a)a=b;}
int main()
{int n,p,k,i,j,x,y,nw,nx,ans=0;n=read();p=read();k=read();for(i=read();i--;)++a[read()];for(i=read();i--;)++b[read()];if(p*k>=2*n){for(i=1;i<=n;++i)if(a[i]||b[i])++ans;return 0*printf("%d",ans);}memset(f[0],128,sizeof(f[0]));f[0][0][0][0]=0;for(i=0;i<n;++i){nw=i&1;nx=nw^1;memset(f[nx],128,sizeof(f[nx]));for(j=0;j<=p;++j)for(x=0;x<k;++x)for(y=0;y<k;++y)if(f[nw][j][x][y]>=0){if(x&&y)up(f[nx][j][x-1][y-1],f[nw][j][x][y]+(a[i+1]||b[i+1]));if(!x&&y){up(f[nx][j][0][y-1],f[nw][j][x][y]+b[i+1]);if(j<p)up(f[nx][j+1][k-1][y-1],f[nw][j][x][y]+(a[i+1]||b[i+1]));}if(x&&!y){up(f[nx][j][x-1][0],f[nw][j][x][y]+a[i+1]);if(j<p)up(f[nx][j+1][x-1][k-1],f[nw][j][x][y]+(a[i+1]||b[i+1]));}if(!x&&!y){up(f[nx][j][0][0],f[nw][j][0][0]);if(j<p)up(f[nx][j+1][k-1][0],f[nw][j][x][y]+a[i+1]),up(f[nx][j+1][0][k-1],f[nw][j][x][y]+b[i+1]);if(j+1<p)up(f[nx][j+2][k-1][k-1],f[nw][j][x][y]+(a[i+1]||b[i+1]));}}}printf("%d",f[nx][p][0][0]);
}