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 N = 2e5 + 10;
int n, w[N];
vector<pair<int, int> > G[N];
int v[N], second[N], rt, ans1;
double d[N], ans2 = 1e18, sum;
void find(int x, int fa, int S) {
  second[x] = 1;
  int M = 0;
  for (auto i : G[x]) {
    int to = i.first, t = i.second;
    if (to == fa || v[to]) continue;
    find(to, x, S);
    M = max(M, second[to]), second[x] += second[to];
  }
  M = max(M, S - second[x]);
  if (M <= S / 2) rt = x;
}
void calc(int x, int fa, int wh, int t) {
  sum += pow(t, 1.5) * w[x], d[wh] += pow(x, 0.5) * 1.5 * w[x];
  for (auto i : G[x])
    if (i.first != fa) calc(i.first, x, wh, i.second + t);
}
void dfs(int x, int S) {
  find(x, 0, S), x = rt, find(x, 0, S);
  if (v[x]) return;
  v[x] = 1, sum = 0.0;
  double sd = 0.0, M = 0.0;
  int wh = 0;
  for (auto i : G[x]) {
    int to = i.first;
    d[to] = 0, calc(to, x, to, i.second), sd += d[to];
    if (d[to] > M) wh = to, M = d[to];
  }
  if (sum < ans2) ans1 = x, ans2 = sum;
  if (sd - 2 * M < 0) dfs(wh, second[wh]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    G[u].push_back(make_pair((v), (w))), G[v].push_back(make_pair((u), (w)));
  }
  dfs(1, n);
  printf("%d %.10f\n", ans1, ans2);
  return 0;
}
