/*
* Author: Nonoze
* Created: Saturday 07/02/2026
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
void solve();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--) solve();
return 0;
}
int n, k, m, q;
vector<vector<int>> adj;
vector<int> depth, par;
void dfs(int u, int p) {
par[u]=p;
for (int v : adj[u]) {
if (v==p) continue;
depth[v]=depth[u]+1;
dfs(v, u);
}
}
void solve() {
read(n, k);
adj.clear(), adj.resize(n);
for (int i=1; i<n; i++) {
int u, v; read(u, v); u--, v--;
adj[u].pb(v), adj[v].pb(u);
}
depth.clear(), depth.resize(n), par.clear(), par.resize(n, -1);
dfs(0, -1);
vector<bool> vis(n, 0); vis[0]=1;
vector<vector<int>> nadj(n);
for (int i=0; i<n; i++) {
if (depth[i]==k) {
int x=i;
while (!vis[x]) {
vis[x]=1;
if (find(all(nadj[par[x]]), x) == nadj[par[x]].end()) nadj[par[x]].pb(x);
x=par[x];
}
}
}
if (k>=20) quit("DA");
swap(adj, nadj);
vector<vector<int>> nxt(n, vector<int>(k, n));
for (int i=0; i<n; i++) if (depth[i]==k) {
for (int j=0; j<k; j++) {
int cur=i;
while (depth[cur]-1>j) cur=par[cur];
int x=cur; cur=par[cur];
while (cur!=-1) {
bool ok=0;
for (auto &v: adj[cur]) {
if (ok) {
ok=0;
nxt[i][j]=v;
break;
}
if (v==x) {
ok=1;
}
}
if (!ok) break;
x=cur, cur=par[cur];
}
if (nxt[i][j]!=n) {
while (depth[nxt[i][j]]<k) nxt[i][j]=adj[nxt[i][j]][0];
}
}
}
dbg(adj);
vector<int> list_k;
auto dfs2 = [&](auto&& self, int u) -> void {
if (depth[u]==k) list_k.pb(u);
for (int v : adj[u]) self(self, v);
};
dfs2(dfs2, 0);
vector<bitset<(1<<19)>> dp(n+1); dp[list_k[0]][0]=1;
for (auto &i: list_k) if (depth[i]==k) {
for (int j=0; j<(1<<k); j++) {
if (dp[i][j]) {
for (int x=0; x<k; x++) if (!(j&(1<<x))) {
dp[nxt[i][x]][j|(1<<x)]=1;
}
}
}
}
for (int i=0; i<(1<<k); i++) if (dp[n][i]) quit("DA");
quit("NE");
}
