i think the problem is easy but get WA :(
#include<iostream.h>

int   N;
short conv[6001];
int   dad[6001];

void main()
{
int  i, l, k;
long min, sum;
    cin>>N;
    sum = 0;
    for (i=1; i<=N; i++)
    {
        cin>>conv[i];
        dad[i]=0;
        sum+=conv[i];
    }
    cin>>l>>k;
    while (l!=0 && k!=0)
    {
        dad[l]=k;
        cin>>l>>k;
    }
min = 32767;
int p;
    for (i=1; i<=N; i++)
        if (dad[i]==0) p = i;
    for (i=1; i<=N; i++)
        if (dad[i]!=0 && dad[i]!=p)
            if ( conv[i] + conv[dad[i]]<min )
                min = conv[i] + conv[dad[i]];
    cout<<(sum-min)<<endl;
}