#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<cstring>
using namespace std;
bool used[20005]={0};
vector<int>con[20005];
vector<int>val[20005];
int n,q[3],u,v,w,num,sum,answer=99999999,ans;
int ww[3][20005]={0};
void dfs(int x);
int main()
{
	freopen ("escapeb.in","r",stdin);
	freopen ("escapeb.out","w",stdout);
	cin>>n>>q[0]>>q[1]>>q[2];
	for (int i=1;i<n;i++)
	{
		cin>>u>>v>>w;
		con[u].push_back(v);
		con[v].push_back(u);
		val[u].push_back(w);
		val[v].push_back(w);
	}
	for (num=0;num<3;num++)
	{
		memset(used,0,sizeof(used));
		used[q[num]]=1;
		dfs(q[num]);
	}
	for (int i=1;i<=n;i++)
	{
		sum=0;
		for (int j=0;j<3;j++)
		{
			sum+=ww[j][i];
		}
		if (sum<answer)
		{
			answer=sum;
			ans=i;
		}
	}
	cout<<ans<<endl<<answer;
	return 0;
}

void dfs(int x)
{
	for (int i=0;i<con[x].size();i++)
	{
		if (!used[con[x][i]])
		{
			ww[num][con[x][i]]=ww[num][x]+val[x][i];
			used[con[x][i]]=1;
			dfs(con[x][i]);
		}
	}
}