#include <bits/stdc++.h>

using namespace std;

ifstream f("concurs.in");
ofstream g("concurs.out");
int h,n,m,v[32005],fnd[32005],mx,x2,y2;
pair <short int,short int>rmq[16][64010];
vector <int> V[32005];
void dfs(int x,int lvl)
{
    rmq[0][++h].first=x;
    fnd[x]=h;
    rmq[0][h].second=lvl;
    for(int i=0; i<V[x].size(); i++)
    {
        dfs(V[x][i],lvl+1);
        rmq[0][++h].first=x;
        rmq[0][h].second=lvl;
    }
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        f>>v[i];
    for(int i=1; i<n; i++)
    {
        int x,y;
        f>>x>>y;
        V[x].push_back(y);
    }
    dfs(1,0);
    for(int i=1; i<=log2(h)+1; i++)
        for(int j=1; j<=h-(1<<(i-1)); j++)
            if(rmq[i-1][j].second>rmq[i-1][j+(1<<(i-1))].second)
                rmq[i][j]=rmq[i-1][j+(1<<(i-1))];
            else
                rmq[i][j]=rmq[i][j];
    while(m--)
    {
        int x,y;
        f>>x>>y;
        int x1=fnd[x];
        int y1=fnd[y];
        if(x1>y1)
            swap(x1,y1);
        int k=log2(y-x+1);
        if(rmq[k][x1].second>rmq[k][y1-(1<<k)+1].second)
        {
            if(v[rmq[k][y1-(1<<k)+1].first]>mx)
            {
                mx=v[rmq[k][y1-(1<<k)+1].first];
                x2=x,y2=y;
            }
            else if(v[rmq[k][y1-(1<<k)+1].first]==mx)
            {
                if(x==x2)
                {
                    if(y2>y)
                        y2=y;
                }
                else if(x2>x)
                    x2=x;
            }
        }
        else
        {
            if(v[rmq[k][x1].first]>mx)
            {
                mx=v[rmq[k][x1].first];
                x2=x,y2=y;
            }
            else if(v[rmq[k][x1].first]==mx)
            {
                if(x==x2)
                {
                    if(y2>y)
                        y2=y;
                }
                else if(x2>x)
                    x2=x;
            }
        }
    }
    g<<mx<<' '<<x2<<' '<<y2;
    return 0;
}