#include <iostream>
#include <cstdio>
#include <cstring>
#include <climits>
#include <cmath>
#include <algorithm>
using namespace std;

const int maxn=10000+10;
struct node
{
	int father;//只记录父亲节点 
	int time;//from son to father
}a[maxn];
int n,m;
int ans;
int mm;
int u[maxn],v[maxn];

int main()
{
	freopen("diaoyu.in","r",stdin);
	freopen("diaoyu.out","w",stdout);
	
	cin>>n>>m;
	for(int i=1;i<n;i++)
	{
		int x,y,t;//x---->y
		cin>>x>>y>>t;
		a[y].father=x;
		a[y].time=t;
	}
	
	for(int i=1;i<=m;i++)
	{
		cin>>u[i]>>v[i];
	}
	
	for(int i=1;i<=m;i++)
	{
		int sum=0;
		while (a[v[i]].father!=0 && sum<=m)//到树根 时间到头 
		{
			v[i]=a[v[i]].father;//找树根 
			sum+=a[v[i]].time;
			if(v[i]==u[i])//找到 
			{
				ans++;
				mm+=sum;
				break;
			}
		}
	}
	cout<<ans<<endl<<mm<<endl;
	return 0;
}