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>
std::mt19937 rng(
    (int)std::chrono::steady_clock::now().time_since_epoch().count());
const int ms = 200200;
long double ans = 1e30;
int ans2;
int w[ms];
bool visit[ms];
std::vector<std::pair<int, long long> > edges[ms];
long double cur[2];
int size[ms];
void dfs(int on, int par, long long d) {
  long double sq = sqrtl(d);
  cur[0] += d * sq * w[on];
  cur[1] += sq * w[on];
  for (auto e : edges[on]) {
    if (e.first == par) continue;
    dfs(e.first, on, d + e.second);
  }
}
void pre(int on, int par) {
  size[on] = 1;
  for (auto e : edges[on]) {
    if (e.first == par || visit[e.first]) continue;
    pre(e.first, on);
    size[on] += size[e.first];
  }
}
int cen = -1;
int totSize, curSize;
void pre2(int on, int par) {
  int bst = totSize - size[on];
  for (auto e : edges[on]) {
    if (e.first == par || visit[e.first]) continue;
    pre2(e.first, on);
    bst = std::max(bst, size[e.first]);
  }
  if (cen == -1 || curSize > bst) {
    curSize = bst;
    cen = on;
  }
}
void solve() {
  int on = 0;
  while (on != -1 && !visit[on]) {
    pre(on, -1);
    totSize = size[on];
    cen = -1;
    pre2(on, -1);
    on = cen;
    int to = -1;
    cur[0] = cur[1] = 0;
    long double bst = 0;
    for (auto e : edges[on]) {
      cur[1] = 0;
      dfs(e.first, on, e.second);
      if (bst < cur[1]) {
        bst = cur[1];
        to = e.first;
      }
    }
    if (cur[0] < ans) {
      ans = cur[0];
      ans2 = on + 1;
    }
    visit[on] = true;
    on = to;
  }
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  int n;
  std::cin >> n;
  for (int i = 0; i < n; i++) {
    std::cin >> w[i];
  }
  for (int i = 1; i < n; i++) {
    int u, v, l;
    std::cin >> u >> v >> l;
    u--;
    v--;
    edges[u].emplace_back(v, l);
    edges[v].emplace_back(u, l);
  }
  solve();
  std::cout << std::fixed << std::setprecision(10) << ans2 << ' ' << ans
            << '\n';
}
