#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll piar<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define ov3(a,b,c,name,...)name
#define rep0(n) for(ll aaaaa = 0; aaaaa < n;++aaaaa)
#define rep1(i,n) for(ll i = 0;i < (n); i++)
#define rep2(i,a,b) for(ll i = (a); i <(b); i ++)
#define rep(...) ov3(__VA_ARGS__, rep2,rep1,rep0)(__VA_ARGS__)
#define fore(e,v) for(auto &&e:v)
#define all(a) begin(a),end(a)
#define si(a) (int)(size(a))
bool chmin(auto &a, auto b){return a>b?a = b,1:0;}
bool chmax(auto &a, auto b){return a<b?a = b,1:0;}

#define pb push_back
#define eb emplace_back
#define i128 __int128_t

const ll inf = LLONG_MAX / 3;

int main(){
    cin.tie(0) -> sync_with_stdio(0);
    ll n,m;
	cin>>n>>m;
	vector<vector<pair<ll,ll> > > g(n);
	vl k(n - 1),l(n - 1);
	rep(i,n - 1){
		ll u,v;
		cin>>u>>v;
		u--,v--;
		cin>>l[i]>>k[i];
		g[u].eb(v,i);
		g[v].eb(u,i);
	}
	vl c(n);
	c[0] = 0;
	for(ll i =1;i < n;i++)cin>>c[i];
	vl e(n);
	ll ans = 0;
	bool ok = 1;
	function<void(ll,ll,ll,ll)> dfs = [&](ll x,ll frm,ll kj,ll lj){
		e[x] = c[x];
		ll sum = 0;
		for(auto &&[y,j] : g[x])if(y != frm){
			dfs(y,x,k[j],l[j]);
			sum+=e[y];
		}
		chmax(e[x],sum);
		if(e[x] > kj)ok = 0;
		else ans += e[x] * lj;
	};
	dfs(0,-1,2e9,0);
	for(ll i = 1;i <= m;i++){
		if(ok && e[0] <= i){
			cout<<ans<<"\n";
		}
		else{
			cout<<-1<<"\n";
		}
	}
}