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

struct node
{
	int fa,w;
};
const int maxn=10000+5;
node a[maxn];
int n,m;
unsigned long long ans,c;
int main()
{
	freopen("diaoyu.in","r",stdin);
	freopen("diaoyu.out","w",stdout);
	
	cin>>n>>m;
	for(int i=1;i<n;i++)
	{
		int s,e,w;
		scanf("%d%d%d",&s,&e,&w);
		a[e].fa=s;
		a[e].w=w;
	}
	//ji lu fu jie dian he dao fu jie dian de zhi
	for(int i=1;i<=m;i++)
	{
		int s,e;
		scanf("%d%d",&s,&e);
		if(s==e) continue;
		int w=0;
		int t=e,t2=0;
		while(t!=s)
		{
			w+=a[t].w;
			t2++;
			if(t2>n || a[t].fa==0) break;
			t=a[t].fa;
		}
		if(t==s)
		{
			c++; ans+=w;
		}
	}
	cout<<c<<endl<<ans<<endl;
	return 0;
}