#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

#define MAX_N 10000

unsigned long int lens[MAX_N][MAX_N];
unsigned long int vals[MAX_N][MAX_N];
int graph[MAX_N][MAX_N];
int en[MAX_N];
int beauty[MAX_N];
int n;

int findMaxVertex(int start, int max) {
    int stack[MAX_N],  s = 0;
    int visited[MAX_N] = {};
    int maxV = -1, i;

    stack[s++] = start;
    visited[start] = 1;

    while (s > 0) {
        int v = stack[--s];
        maxV = (maxV == -1 || beauty[v] > beauty[maxV])? v : maxV;

        for (i=0; i<en[v]; i++) {
            int j = graph[v][i];
            if (!visited[j] && beauty[j] < max) {
                stack[s++] = j;
                visited[j] = 1;
            }
        }
    }

    return maxV;
}

int getComponent(int start, int component[MAX_N], int max) {
    int stack[MAX_N],  s = 0;
    int visited[MAX_N] = {}, i, c = 0;

    stack[s++] = start;
    visited[start] = 1;
    
    while (s > 0) {
        int v = stack[--s];
        component[c++] = v;

        for (i=0; i<en[v]; i++) {
            int j = graph[v][i];
            if (!visited[j] && beauty[j] < max) {
                stack[s++] = j;
                visited[j] = 1;
            }
        }
    }

    return c;
}

int compare(const void *a, const void *b) {
    int x = *((int*) a);
    int y = *((int*) b);
    return x - y;
}

int getNeighbours(int neighbours[MAX_N], int v, int max) {
    int i, nn = 0, j = 0;
    for (i=0; i<n; i++) {
        if (beauty[i] >= max && graph[v][j] == i) j++;
        if (beauty[i] < max && graph[v][j] == i) {
            neighbours[nn++] = i;
            j++;
        }
    }
    return nn;
}

void fillVals(int vertices[MAX_N], int start, int c, int max) {
    if (c == 1) {
        fprintf(stderr, "(%d)\n", vertices[0]);
        return;
    }

    int v = findMaxVertex(start, max);
    fprintf(stderr, "%d\n", v);
    
    int neighbours[MAX_N], nn;
    nn = getNeighbours(neighbours, v, max);

    int i, j;
    fprintf(stderr, "n %d: ", v);
    for (i=0; i<nn; i++)
        fprintf(stderr, "%d ", neighbours[i]);
    fprintf(stderr, "\n");

    int (*components)[MAX_N], *cn;
    components = (int(*)[MAX_N]) malloc(sizeof(int*) * nn);
    cn = (int*) malloc(sizeof(int) * nn);

    for (i=0; i<nn; i++) {
        cn[i] = getComponent(neighbours[i], components[i], beauty[v]);
        fprintf(stderr, "c %d: ", neighbours[i]);

        qsort(components[i], cn[i], sizeof(int), compare);
    
        for (j=0; j<cn[i]; j++)
            fprintf(stderr, "%d ", components[i][j]);
        fprintf(stderr, "\n");
    }

    for (i=0; i<nn; i++) {
        fillVals(components[i], neighbours[i], cn[i], beauty[v]);
    }

    for (i=0; i<nn; i++) {
        for (j=0; j<cn[i]; j++) {
            int x = components[i][j];
            lens[v][x] = lens[x][v] = lens[neighbours[i]][x] + 1;
            vals[v][x] = vals[x][v] = beauty[v];
        }
    }

    for (i=0; i<c; i++) {
        for (j=0; j<c; j++) {
            if (i == j) continue;
            if (i == v || j == v) continue;
            int x = vertices[i];
            int y = vertices[j];
            if (vals[x][y]) continue;
            lens[x][y] = lens[y][x] = lens[v][x] + lens[v][y];
            vals[x][y] = vals[y][x] = beauty[v];
        }
    }

    free(components);
    free(cn);
}

int main() {
    int i, j, a, b, vertices[MAX_N];
    
    scanf("%d", &n);

    for (i=0; i<n; i++)
        scanf("%d", &beauty[i]);

    for (i=0; i<n-1; i++) {
        scanf("%d%d", &a, &b);
        a--, b--;
        graph[a][en[a]++] = b;
        graph[b][en[b]++] = a;
    }

    for (i=0; i<n; i++) {
        fprintf(stderr, "%d (%d): ", i, beauty[i]);
        for (j=0; j<en[i]; j++) {
            fprintf(stderr, "%d%c", graph[i][j], (j<en[i]-1)? ' ':'\n');
        }
    }

    for (i=0; i<n; i++)
        vertices[i] = i;

    fillVals(vertices, 0, n, n+1);

    for (i=0; i<n; i++) {
        for (j=0; j<n; j++) {
            fprintf(stderr, "%2ld ", lens[i][j]);
        }
        fprintf(stderr, "\n");
    }
    fprintf(stderr, "\n");
    for (i=0; i<n; i++) {
        for (j=0; j<n; j++) {
            fprintf(stderr, "%2ld ", vals[i][j]);
        }
        fprintf(stderr, "\n");
    }

    unsigned long int sum = 0;

    for (i=0; i<n; i++) {
        for (j=i+1; j<n; j++) {
            sum += lens[i][j] * vals[i][j] % 1000000007;
        }
    }

    printf("%ld\n", sum);

    return 0;
}