#include <fstream>

#define N 100001
#define M 200001

int n, m, nr, nodes[2 * M], next[2 * M], list[M], v[N], sum[N], r;
bool vis[N];

inline void add(int from, int to) {
    ++nr;
    nodes[nr] = to;
    next[nr] = list[from];
    list[from] = nr;
}

inline int dfs(int x) {
    if (vis[x]) return sum[x];
    vis[x] = true;
    int p = list[x];
    int t;
    while (p != 0) {
        t = dfs(nodes[p]);
        if (t > 0) sum[x] += t;
        p = next[p];
    }
    if (r < sum[x]) r = sum[x];
    return true;
}

int main() {
    std::ifstream in("asmax.in");
    std::ofstream out("asmax.out");
    in >> n >> m;
    int x, y;
    for (int i = 1; i <= n; ++i) {
        in >> v[i];
    }
    for (int i = 1; i < n; ++i) {
        in >> x >> y;
        add(x, y);
        add(y, x);
    }
    out << r;
    return 0;
}