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;
int w[200005];
vector<int> adj[200005];
vector<int> l[200005];
double diff[200005];
map<int, double> M;
double calc(int node, int parent, int dis) {
  diff[node] = w[node] * sqrt(double(dis));
  double ret = diff[node] * dis;
  for (int i = (0); i < int(adj[node].size()); ++i) {
    int to = adj[node][i];
    if (to == parent) continue;
    ret += calc(to, node, dis + l[node][i]);
    diff[node] += diff[to];
  }
  return ret;
}
double fun(int node) {
  if (M.find(node) != M.end()) return M[node];
  M[node] = calc(node, -1, 0);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = (0); i < int(n); ++i) scanf("%d", w + i);
  for (int i = (0); i < int(n - 1); ++i) {
    int a, b;
    int L;
    scanf("%d%d%d", &a, &b, &L);
    --a;
    --b;
    adj[a].push_back(b);
    adj[b].push_back(a);
    l[a].push_back(L);
    l[b].push_back(L);
  }
  int best = rand() % n;
  double bestVal = 1000000000000000000LL;
  int curNode = best;
  for (int i = (0); i < int(40); ++i) {
    curNode = best;
    calc(curNode, -1, 0);
    int c = curNode;
    int p = -1;
    for (int j = (1); j < int(8200); ++j) {
      int bestAdj = -1;
      double bestAdjDiff = -1;
      for (int k = (0); k < int(adj[c].size()); ++k) {
        int to = adj[c][k];
        if (to == p) continue;
        if (diff[to] > bestAdjDiff) {
          bestAdj = to;
          bestAdjDiff = diff[to];
        }
      }
      if (bestAdj == -1) break;
      p = c;
      c = bestAdj;
      if (__builtin_popcount(j) == 1) {
        double val = calc(c, -1, 0);
        if (val < bestVal) {
          bestVal = val;
          best = c;
        }
      }
    }
  }
  printf("%d %.7lf\n", best + 1, bestVal);
}
