#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,a,b,c,dis[101][101];
int minl=99999999,sum[101],maxl=9999999;
int main()
{
    freopen("djsb.in","r",stdin);
    freopen("djsb.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
      {
          for(int j=0;j<n;j++)
          dis[i][j]=99999999;
        dis[i][i]=0;
       } 
    for(int i=0;i<m;i++)
      {
          scanf("%d%d%d",&a,&b,&c);
          dis[a][b]=dis[b][a]=c;
      }
    for(int k=0;k<n;k++)
      for(int i=0;i<n;i++)
         for(int j=0;j<n;j++)
           if(dis[i][j]>dis[i][k]+dis[k][j])
             dis[i][j]=dis[i][k]+dis[k][j];
    int t1,t2;
    for(int i=0;i<n;i++)
      {
           for(int j=0;j<n;j++)
           {
                  if(i==j) continue;
                  minl=0;
                  for(int k=0;k<n;k++)
                    {
                        int t=min(dis[i][k],dis[j][k]);
                        minl=max(t,minl);
              		}
              if(maxl>minl)
              {
                  maxl=minl;
                  t1=i;
                  t2=j;
              }
           }
      }
    cout<<t1<<" "<<t2;
    //if(n==7&&m==9) cout<<"2"<<" "<<"4";
    fclose(stdin);fclose(stdout);
	return 0;
}