#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
vc<void*> ptrs;
template <class N>
struct linkcut {
  struct Node {
    using np = Node*;
    np l, r, p;
    bool rev;
    N x;
    Node() : l(0), r(0), p(0), rev(false), x() {}
    void reverse() {
      rev ^= true;
      x.reverse();
    }
    void propagate() {
      if (rev) {
        swap(l, r);
        if (l) l->reverse();
        if (r) r->reverse();
        rev = false;
      }
      if (l) x.push(l->x);
      if (r) x.push(r->x);
      x.clear();
    }
    void update() {
      x.single();
      if (l) x.updatel(l->x);
      if (r) x.updater(r->x);
    }
    ll pos() {
      if (p && p->l == this) return -1;
      if (p && p->r == this) return 1;
      return 0;
    }
    void prepare() {
      if (pos()) p->prepare();
      propagate();
    }
    void rotate() {
      np q = p, c;
      if (pos() == 1) {
        c = l;
        l = p;
        p->r = c;
      } else {
        c = r;
        r = p;
        p->l = c;
      }
      if (c) c->p = p;
      p = p->p;
      q->p = this;
      if (p && p->l == q) p->l = this;
      if (p && p->r == q) p->r = this;
      q->update();
    }
    void splay() {
      prepare();
      while (pos()) {
        ll first = pos(), second = p->pos();
        if (second && first == second) p->rotate();
        if (second && first != second) rotate();
        rotate();
      }
      update();
    }
    void expose() {
      for (np first = this; first; first = first->p) first->splay();
      for (np first = this; first->p; first = first->p) {
        ptrs.push_back(first->p);
        first->p->r = first;
        first->p->update();
      }
      splay();
    }
    void evert() {
      expose();
      if (l) {
        l->reverse();
        l = 0;
        update();
      }
    }
    void link(np first) {
      evert();
      p = first;
    }
    template <class F, class... Args>
    np find(F f, Args&&... args) {
      if (!(x.*f)(forward<Args>(args)...)) return 0;
      propagate();
      x.single();
      np first = 0;
      if (l) first = l->find(f, forward<Args>(args)...);
      if (first) return first;
      if ((x.*f)(forward<Args>(args)...)) {
        splay();
        return this;
      }
      return r->find(f, forward<Args>(args)...);
    }
    void cutchild() {
      expose();
      r = 0;
      update();
    }
    void cutpar() {
      expose();
      assert(l);
      l->p = 0;
      l = 0;
      update();
    }
  } * x;
  linkcut(ll n) { x = new Node[n]; }
  ~linkcut() { delete[] x; }
  using np = typename Node::np;
  ll lca(ll aa, ll bb) {
    np first = x + aa, second = x + bb;
    first->expose();
    second->expose();
    if (!first->p) return -1;
    np d = first;
    while (first->p != second) {
      if (first->pos() == 0) d = first->p;
      first = first->p;
    }
    if (first == second->l)
      return d - x;
    else
      return second - x;
  }
  void link(ll first, ll second) { x[first].link(x + second); }
  void cutpar(ll first) { x[first].cutpar(); }
  void expose(ll first) { x[first].expose(); }
  void evert(ll first) { x[first].evert(); }
  void expose_path(ll first, ll second) {
    x[first].evert();
    x[second].cutchild();
  }
  N& operator[](ll i) { return x[i].x; }
  template <class F, class... Args>
  ll find(ll first, F f, Args&&... args) {
    np res = x[first].find(f, forward<Args>(args)...);
    if (res)
      return res - x;
    else
      return -1;
  }
  void setval(ll first, ll v) { x[first].x.mx = v; }
  void stuff(ll first, ll v) {
    if (x[first].l) {
      x[first].l->x.upd(v);
    }
  }
  vi getlist() {
    vi res;
    for (auto p : ptrs) {
      res.push_back((Node*)p - x);
    }
    ptrs.clear();
    return res;
  }
};
struct N {
  ll mx, lz;
  void init() {
    mx = -inf;
    lz = -inf;
  }
  void reverse() {}
  void upd(ll v) {
    chmax(mx, v);
    chmax(lz, v);
  }
  void push(N& x) { x.upd(lz); }
  void clear() { lz = -inf; }
  void single() { lz = -inf; }
  void updatel(const N&) { assert(lz == -inf); }
  void updater(const N&) { assert(lz == -inf); }
};
const ll nmax = 100010;
vc<pi> t[nmax];
ll dep[nmax];
void dfs(ll v, ll d, linkcut<N>& lc) {
  dep[v] = d;
  if (ll(t[v].size())) {
    for (auto e : t[v]) dfs(e.first, d + e.second, lc);
  } else
    lc.expose(v);
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n, m;
  cin >> n >> m;
  linkcut<N> lc(n);
  for (ll _ = ll(0); _ < ll(n - 1); _++) {
    ll first, second, c;
    cin >> first >> second >> c;
    first--;
    second--;
    t[first].emplace_back(second, c);
    lc.link(second, first);
  }
  dfs(0, 0, lc);
  lc.getlist();
  vc<pi> waf;
  for (ll i = ll(0); i < ll(n); i++) lc.setval(i, -dep[i]);
  {
    for (ll _ = ll(0); _ < ll(m); _++) {
      ll s, z;
      cin >> s >> z;
      s--;
      lc.expose(s);
      vi idx = lc.getlist();
      for (auto i : idx) {
        ll pre = lc[i].mx + 1 + dep[i];
        ll w = z + dep[i];
        void(0);
        waf.emplace_back(pre, w);
      }
      lc.stuff(s, z);
    }
  }
  sort(waf.begin(), waf.end());
  void(0);
  auto dame = [&]() -> ll {
    priority_queue<ll, vc<ll>, greater<ll>> pq;
    ll cur = 1;
    ll ret = -1;
    auto adv = [&](ll to) {
      while (cur < to && ll(pq.size())) {
        ll r = pq.top();
        pq.pop();
        if (cur > r) {
          ret = r;
          break;
        }
        cur++;
      }
      cur = to;
    };
    for (auto w : waf) {
      adv(w.first);
      if (ret != -1) return ret;
      pq.push(w.second);
    }
    adv(inf);
    if (ret != -1) return ret;
    cout << -1 << " " << ll(waf.size()) << endl;
    exit(0);
  };
  ll lim = dame();
  ll cnt = 0;
  for (auto w : waf)
    if (w.second < lim) cnt++;
  cout << lim << " " << cnt << endl;
}
