#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back
#define pil pair <int, ll> 
#define LL __int128

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 65, S = 10005; 
const ll mod = 11920928955078125;  
int n, m, c; 
ll M, w[N], v[N], k, dis[N][N], f[N][S]; 
vector <pil> e[N];

void dfs (int rt, int p, int fa) {
	for (auto i : e[p]) {
		if (i.fi == fa) continue; 
		dis[rt][i.fi] = dis[rt][p]+i.se; dfs(rt, i.fi, p); 
	}
}

vector <int> tmp1, tmp2; 
void dp (int p, int fa) {
	
}

void solve () {
	cin >> n >> m >> k >> M;
	for (int i = 1;i <= n;i++) cin >> w[i];
	for (int i = 1;i <= n;i++) cin >> v[i]; 
	for (int i = 1;i < n;i++) {
		int x, y; ll c; cin >> x >> y >> c; 
		e[x].pb({y, c}); e[y].pb({x, c}) ;
	}
	for (int i = 1;i <= n;i++) dfs(i, i, 0); 
	dp(1, 0); 
}

signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	return 0; 
	int T = 1; 
	while (T--) solve();
	return 0;
}