#include <bits/stdc++.h>

using namespace std;

#define Rep(i, a, b) for(int i = a; i <= b; i ++)

#define gc getchar()

inline int read() {

    int x = ; char c = gc;

    while(c < '' || c > '') c = gc;

    while(c >= '' && c <= '') x = x *  + c - '', c = gc;

    return x;

}

const int N = 1e5 + ;

int n, Cnt[N], Size[N], fa[N], Sum;

struct Node {

    int u, v, w;

    bool operator < (Node a) const {

        return this->w < a.w;

    }

} G[N];

bool Ok;

int Get(int x) {

    return fa[x] == x ? x : fa[x] = Get(fa[x]);

}

void Merge(int x, int y) {

    x = Get(x), y = Get(y);

    Size[x] += Size[y];

    Cnt[x] += Cnt[y];

    fa[y] = x;

    if(Size[x] > Sum - Cnt[x]) Ok = ;

}

int main() {

    n = read();

    Rep(i, , n - ) G[i] = (Node) {

        read(), read(), read()

    };

    sort(G + , G + n);

    Rep(i, , n) Cnt[i] = read(), Sum += Cnt[i];

    Rep(i, , n) fa[i] = i, Size[i] = ;

    int Answer = ;

    Ok = ;

    Rep(i, , n - ) {

        if(Ok) Answer = G[i].w;

        Merge(G[i].u, G[i].v);

    }

    cout << Answer;

    return ;

}