// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=1203465797;
const int inf = 1e14;
const int LOG=18;
const int N=1e3+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
map<pair<int,int>,pair<int,int>>ed;
vector<int>a[N];
int ans[N];
int hv[N];
void dfs(int x,int y){
for (int i=1;i<=m;i++){
ans[x]+=hv[i]>=1;
}
for (int i:a[x]){
if (i==y)continue;
int l=ed[{x,i}].fi,r=ed[{x,i}].se;
for (int j=l;j<=r;j++){
hv[j]++;
}
dfs(i,x);
for (int j=l;j<=r;j++){
hv[j]--;
}
}
}
void solve(){
cin >> n >> m;
for (int i=0;i<n-1;i++){
cin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
cin >> l >> r;
ed[{x,y}]={l,r};
ed[{y,x}]={l,r};
}
dfs(1,0);
for (int i=2;i<=n;i++){
cout << ans[i] << endl;
}
}
signed main()
{
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(9);
srand(time(0));
// int t=1;
// cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
}
