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 MX = 202020;
int N;
int val[MX];
bool used[MX];
int sz[MX], mx[MX];
double c0[MX], c1[MX];
vector<pair<int, int> > el[MX];
int went[MX], idw;
int dfs0(int v, int fa) {
  mx[v] = 0;
  int s = 0;
  for (auto p : el[v]) {
    int u = p.first;
    if (u == fa or used[u]) continue;
    int t = dfs0(u, v);
    s += t;
    mx[v] = max(mx[v], t);
  }
  sz[v] = s + 1;
  went[idw++] = v;
  return sz[v];
}
int findCenter(int v) {
  idw = 0;
  dfs0(v, -1);
  int tot = sz[v];
  int best = 1e9, bv = -1;
  for (int(i) = 0; (i) < (idw); (i)++) {
    int u = went[i];
    if (max(mx[u], tot - sz[u]) < best) {
      best = max(mx[u], tot - sz[u]);
      bv = u;
    }
  }
  return bv;
}
void calCost(int v, int fa = -1, double d = 0.0) {
  double s0 = 0.0, s1 = 0.0;
  for (auto p : el[v]) {
    int u = p.first, c = p.second;
    if (u == fa) continue;
    calCost(u, v, d + c);
    s0 += c0[u];
    s1 += c1[u];
  }
  s0 += val[v] * sqrt(d);
  s1 += val[v] * sqrt(d) * d;
  c0[v] = s0;
  c1[v] = s1;
}
double calGrad(int v, int fa, double d = 0.0) {
  double s = 0.0;
  for (auto p : el[v]) {
    int u = p.first, c = p.second;
    if (u == fa) continue;
    s += calGrad(u, v, d + c);
  }
  s += val[v] * pow(d, 0.5);
  return s;
}
int main() {
  scanf("%d", &N);
  for (int(i) = 0; (i) < (N); (i)++) scanf("%d", val + i + 1);
  for (int(i) = 0; (i) < (N - 1); (i)++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    el[a].push_back(make_pair(b, c));
    el[b].push_back(make_pair(a, c));
  }
  int nv = 1;
  double best = 1e20;
  int bestV = -1;
  int z = 0;
  while (true) {
    int cen = findCenter(nv);
    calCost(cen);
    double c = c1[cen];
    if (best > c) {
      best = c;
      bestV = cen;
    }
    double bg = 0.0;
    int bc = -1;
    for (auto p : el[cen]) {
      int v = p.first;
      if (used[v]) continue;
      double g = c0[v];
      if (bg < g) {
        bg = g;
        bc = v;
      }
    }
    if (bc == -1) break;
    used[cen] = true;
    nv = bc;
    z++;
    if (z > 20) break;
  }
  printf("%d %.8f", bestV, best);
  return 0;
}
