3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long double pi = acos(-1.0);
const string debug_line = "yolo";
const long double PI = acos((long double)-1.0);
const double InfCost = 1e99;
long long a[200010];
bool visited[200010];
int size1[200010];
bool deleted[200010];
vector<pair<int, int> > Adj[200010];
int answer1 = 1;
double minDist;
double currDist;
void DFS(int u, int p, double prev) {
  currDist = currDist + 1.0 * a[u] * 1.0 * pow((prev), 1.5);
  for (auto &(t1) : (Adj[u])) {
    if (t1.first != p) {
      DFS(t1.first, u, prev + t1.second);
    }
  }
}
double getDistance(int node) {
  currDist = 0;
  DFS(node, -1, 0);
  return currDist;
}
void calcSize(int u, int p) {
  size1[u] = 1;
  for (auto &(t1) : (Adj[u])) {
    if (t1.first != p && !deleted[t1.first]) {
      calcSize(t1.first, u);
      size1[u] += size1[t1.first];
    }
  }
}
int getCentroid(int u, int p, int compSize) {
  for (auto &(t1) : (Adj[u])) {
    if (t1.first != p && !deleted[t1.first]) {
      if (2 * size1[t1.first] > compSize) {
        return getCentroid(t1.first, u, compSize);
      }
    }
  }
  return u;
}
void decompose(int u, int p, int level) {
  calcSize(u, -1);
  int center = getCentroid(u, -1, size1[u]);
  double currAnswer = getDistance(center);
  if (currAnswer < minDist) {
    minDist = currAnswer;
    answer1 = center;
  }
  int currNode = -1;
  currAnswer = 10000000000000000LL;
  deleted[center] = true;
  int count1 = 0;
  for (auto &(t1) : (Adj[center])) {
    if (!deleted[t1.first]) {
      double currDistS = getDistance(t1.first);
      if (currDistS < currAnswer) {
        currAnswer = currDistS;
        currNode = t1.first;
        count1++;
      }
    }
  }
  if (currAnswer < minDist) {
    minDist = currAnswer;
    answer1 = currNode;
  }
  if (count1 > 1 && currNode != center) {
    decompose(currNode, center, level + 1);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int(i) = (1); (i) < (n + 1); ++(i)) {
    int temp;
    scanf("%d", &temp);
    a[i] = temp;
  }
  for (int(i) = (1); (i) < (n); ++(i)) {
    int a1, b1, l1;
    scanf("%d%d%d", &a1, &b1, &l1);
    Adj[a1].push_back(make_pair(b1, l1));
    Adj[b1].push_back(make_pair(a1, l1));
  }
  minDist = getDistance(1);
  decompose(1, -1, 0);
  printf("%d %.6lf\n", answer1, minDist);
  return 0;
}
