#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <vector>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
using namespace std;

const int maxn=100000+10;
struct node
{
	int father;
	int time;
};
node a[maxn];
int n,m,v,x,y,t,u;
long long ans1,ans2,ans;

int main()
{
	freopen("diaoyu.in","r",stdin);
	freopen("diaoyu.out","w",stdout);
	
	cin>>n>>m;

	for (int i=1; i<n; i++)
	{
		cin>>x>>y>>t;
		a[y].father=x;
		a[y].time=t;
	}
	for (int i=1; i<=m; i++)
	{
		cin>>u>>v;
		if(u>=v)
		{
			continue;
		}
		while (v>u)
		{
			ans+=a[v].time;
			v=a[v].father;
			
		}
		if(v==u)
		{
			ans1++;
			ans2+=ans;
		}
		ans=0;
	}
	cout<<ans1<<endl<<ans2<<endl;
	return 0;
}