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 + 5;
int n, val[N], sz[N], w[N], vis[N], sum, rt;
double sd[N], S, sumd;
vector<pair<int, int> > E[N];
pair<double, int> ans;
void dfs(int u, int f) {
  sz[u] = 1;
  w[u] = 0;
  for (auto x : E[u]) {
    int v = x.first;
    if (v == f || vis[v]) continue;
    dfs(v, u);
    sz[u] += sz[v];
    w[u] = max(w[u], sz[v]);
  }
  w[u] = max(w[u], sum - sz[u]);
  if (w[u] < w[rt]) rt = u;
}
void dfs2(int u, int f, int d, int ac) {
  S += d * sqrt(d) * val[u];
  sd[ac] += 1.5 * sqrt(d) * val[u];
  for (auto x : E[u])
    if (x.first != f) dfs2(x.first, u, d + x.second, ac);
}
void solve(int u) {
  vis[u] = 1;
  S = sumd = 0;
  for (auto x : E[u]) {
    int v = x.first;
    sd[v] = 0;
    dfs2(v, u, x.second, v);
    sumd += sd[v];
  }
  ans = min(ans, {S, u});
  for (auto x : E[u]) {
    int v = x.first;
    if (vis[v]) continue;
    if (sumd - sd[v] - sd[v] < 0) {
      dfs(v, 0);
      rt = 0;
      sum = sz[v];
      dfs(v, 0);
      solve(rt);
      break;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &val[i]);
  for (int i = 1, x, y, z; i < n; ++i) {
    scanf("%d%d%d", &x, &y, &z);
    E[x].push_back({y, z});
    E[y].push_back({x, z});
  }
  ans = {1e30, 0};
  w[0] = sum = n;
  dfs(1, 0);
  solve(rt);
  printf("%d %.10lf\n", ans.second, ans.first);
  return 0;
}
