import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    static ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>();
    static int[] values;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        values = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
            graph.add(new HashMap<>());
        }
        for (int i = 0; i < n - 1; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            graph.get(a).put(b, c);
            graph.get(b).put(a, c);
        }
        TreeMap<Integer, Integer> ans = getMap(0, 0, m);
        System.out.println(ans.lastEntry().getValue());
    }
    
    static TreeMap<Integer, Integer> getMap(int idx, int p, int v) {
        if (v < 0) {
            return new TreeMap<>();
        }
        TreeMap<Integer, Integer> ans = new TreeMap<>();
        ans.put(0, values[idx]);
        for (int x : graph.get(idx).keySet()) {
            if (p == x) {
                continue;
            }
            int cost = graph.get(idx).get(x) * 2;
            TreeMap<Integer, Integer> tmp = getMap(x, idx, v - cost);
            Integer key = Integer.MAX_VALUE;
            while ((key = ans.lowerKey(key)) != null) {
                for (int y : tmp.keySet()) {
                    if (y + cost + key > v) {
                        break;
                    }
                    Integer next = y + cost + key;
                    if (ans.floorEntry(next).getValue() >= ans.get(key) + tmp.get(y)) {
                        continue;
                    }
                    int value = ans.get(key) + tmp.get(y);
                    ans.put(next, value);
                    while ((next = ans.higherKey(next)) != null) {
                        if (ans.get(next) > value) {
                            break;
                        }
                        ans.remove(next);
                    }
                }
            }
        }
        return ans;
    }
    
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}